./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0214_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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/list-ext-properties/test-0214_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 8cac36e956b24d42ea840a07609fb159882a2e76b1195da25a4d4343e0b31026 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:18:13,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:18:13,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:18:14,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:18:14,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:18:14,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:18:14,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:18:14,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:18:14,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:18:14,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:18:14,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:18:14,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:18:14,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:18:14,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:18:14,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:18:14,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:18:14,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:18:14,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:18:14,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:18:14,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:18:14,046 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:18:14,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:18:14,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:18:14,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:18:14,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:18:14,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:18:14,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:18:14,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:18:14,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:18:14,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:18:14,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:18:14,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:18:14,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:18:14,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:18:14,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:18:14,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:18:14,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:18:14,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:18:14,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:18:14,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:18:14,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:18:14,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:18:14,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:18:14,095 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:18:14,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:18:14,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:18:14,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:18:14,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:18:14,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:18:14,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:18:14,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:18:14,098 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:18:14,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:18:14,098 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:18:14,099 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:18:14,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:18:14,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:18:14,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:18:14,099 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:18:14,100 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:18:14,100 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:18:14,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:18:14,100 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:18:14,100 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:18:14,100 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:18:14,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:18:14,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:18:14,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:18:14,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:18:14,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:18:14,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:18:14,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:18:14,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:18:14,102 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 -> 8cac36e956b24d42ea840a07609fb159882a2e76b1195da25a4d4343e0b31026 [2022-07-21 17:18:14,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:18:14,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:18:14,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:18:14,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:18:14,364 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:18:14,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0214_1.i [2022-07-21 17:18:14,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16f7f4a1/31c7cf8f5ba84681a38398d77424b1be/FLAG8b05988b2 [2022-07-21 17:18:14,859 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:18:14,860 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0214_1.i [2022-07-21 17:18:14,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16f7f4a1/31c7cf8f5ba84681a38398d77424b1be/FLAG8b05988b2 [2022-07-21 17:18:14,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16f7f4a1/31c7cf8f5ba84681a38398d77424b1be [2022-07-21 17:18:14,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:18:14,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:18:14,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:18:14,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:18:14,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:18:14,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:18:14" (1/1) ... [2022-07-21 17:18:14,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226817d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:14, skipping insertion in model container [2022-07-21 17:18:14,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:18:14" (1/1) ... [2022-07-21 17:18:14,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:18:14,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:18:15,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:18:15,267 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:18:15,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:18:15,327 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:18:15,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15 WrapperNode [2022-07-21 17:18:15,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:18:15,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:18:15,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:18:15,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:18:15,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (1/1) ... [2022-07-21 17:18:15,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (1/1) ... [2022-07-21 17:18:15,388 INFO L137 Inliner]: procedures = 181, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2022-07-21 17:18:15,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:18:15,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:18:15,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:18:15,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:18:15,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (1/1) ... [2022-07-21 17:18:15,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (1/1) ... [2022-07-21 17:18:15,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (1/1) ... [2022-07-21 17:18:15,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (1/1) ... [2022-07-21 17:18:15,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (1/1) ... [2022-07-21 17:18:15,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (1/1) ... [2022-07-21 17:18:15,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (1/1) ... [2022-07-21 17:18:15,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:18:15,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:18:15,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:18:15,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:18:15,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (1/1) ... [2022-07-21 17:18:15,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:18:15,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:15,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 17:18:15,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 17:18:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-07-21 17:18:15,488 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-07-21 17:18:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 17:18:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:18:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:18:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:18:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:18:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:18:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 17:18:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:18:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:18:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:18:15,591 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:18:15,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:18:15,951 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:18:15,955 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:18:15,955 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 17:18:15,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:18:15 BoogieIcfgContainer [2022-07-21 17:18:15,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:18:15,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:18:15,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:18:15,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:18:15,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:18:14" (1/3) ... [2022-07-21 17:18:15,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f12141f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:18:15, skipping insertion in model container [2022-07-21 17:18:15,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:15" (2/3) ... [2022-07-21 17:18:15,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f12141f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:18:15, skipping insertion in model container [2022-07-21 17:18:15,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:18:15" (3/3) ... [2022-07-21 17:18:15,961 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0214_1.i [2022-07-21 17:18:15,972 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:18:15,973 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-07-21 17:18:16,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:18:16,012 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15d5adaa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a3009dd [2022-07-21 17:18:16,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2022-07-21 17:18:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 90 states have (on average 1.9222222222222223) internal successors, (173), 147 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:18:16,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:16,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:18:16,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:16,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:16,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1044596682, now seen corresponding path program 1 times [2022-07-21 17:18:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:16,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885055316] [2022-07-21 17:18:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:16,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:16,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885055316] [2022-07-21 17:18:16,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885055316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:16,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:16,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:18:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674547967] [2022-07-21 17:18:16,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:16,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 17:18:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:16,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 17:18:16,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 17:18:16,166 INFO L87 Difference]: Start difference. First operand has 151 states, 90 states have (on average 1.9222222222222223) internal successors, (173), 147 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:18:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:16,191 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2022-07-21 17:18:16,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 17:18:16,193 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-07-21 17:18:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:16,200 INFO L225 Difference]: With dead ends: 151 [2022-07-21 17:18:16,201 INFO L226 Difference]: Without dead ends: 148 [2022-07-21 17:18:16,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 17:18:16,205 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:16,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-21 17:18:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-21 17:18:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 88 states have (on average 1.8636363636363635) internal successors, (164), 144 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2022-07-21 17:18:16,248 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 6 [2022-07-21 17:18:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:16,249 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2022-07-21 17:18:16,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:18:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2022-07-21 17:18:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 17:18:16,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:16,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:16,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:18:16,251 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash 594339757, now seen corresponding path program 1 times [2022-07-21 17:18:16,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:16,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429613175] [2022-07-21 17:18:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:16,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:16,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429613175] [2022-07-21 17:18:16,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429613175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:16,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:16,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:18:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913132856] [2022-07-21 17:18:16,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:16,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:16,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:16,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:16,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:16,318 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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) [2022-07-21 17:18:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:16,377 INFO L93 Difference]: Finished difference Result 294 states and 333 transitions. [2022-07-21 17:18:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:16,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 [2022-07-21 17:18:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:16,382 INFO L225 Difference]: With dead ends: 294 [2022-07-21 17:18:16,382 INFO L226 Difference]: Without dead ends: 294 [2022-07-21 17:18:16,384 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:18:16,385 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 163 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:16,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 485 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-21 17:18:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 150. [2022-07-21 17:18:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 90 states have (on average 1.8444444444444446) internal successors, (166), 146 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2022-07-21 17:18:16,398 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 8 [2022-07-21 17:18:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:16,398 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2022-07-21 17:18:16,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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) [2022-07-21 17:18:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2022-07-21 17:18:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 17:18:16,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:16,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:16,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:18:16,402 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:16,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:16,403 INFO L85 PathProgramCache]: Analyzing trace with hash 592492715, now seen corresponding path program 1 times [2022-07-21 17:18:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:16,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211167072] [2022-07-21 17:18:16,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:16,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:16,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211167072] [2022-07-21 17:18:16,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211167072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:16,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:16,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-21 17:18:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136518126] [2022-07-21 17:18:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:16,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:18:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:16,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:18:16,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:18:16,484 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2022-07-21 17:18:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:16,623 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2022-07-21 17:18:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:18:16,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 [2022-07-21 17:18:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:16,625 INFO L225 Difference]: With dead ends: 289 [2022-07-21 17:18:16,625 INFO L226 Difference]: Without dead ends: 289 [2022-07-21 17:18:16,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:18:16,631 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 148 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:16,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 223 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-21 17:18:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 203. [2022-07-21 17:18:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 140 states have (on average 1.8285714285714285) internal successors, (256), 196 states have internal predecessors, (256), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:18:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2022-07-21 17:18:16,651 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 8 [2022-07-21 17:18:16,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:16,651 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2022-07-21 17:18:16,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2022-07-21 17:18:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2022-07-21 17:18:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 17:18:16,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:16,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:16,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:18:16,653 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:16,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash 592492716, now seen corresponding path program 1 times [2022-07-21 17:18:16,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:16,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793669473] [2022-07-21 17:18:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:16,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:16,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:16,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793669473] [2022-07-21 17:18:16,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793669473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:16,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:16,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:18:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444432651] [2022-07-21 17:18:16,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:16,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:16,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:16,754 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2022-07-21 17:18:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:16,873 INFO L93 Difference]: Finished difference Result 360 states and 454 transitions. [2022-07-21 17:18:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:16,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 [2022-07-21 17:18:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:16,875 INFO L225 Difference]: With dead ends: 360 [2022-07-21 17:18:16,875 INFO L226 Difference]: Without dead ends: 360 [2022-07-21 17:18:16,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:16,876 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 151 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:16,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 371 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-21 17:18:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 288. [2022-07-21 17:18:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 409 transitions. [2022-07-21 17:18:16,883 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 409 transitions. Word has length 8 [2022-07-21 17:18:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:16,884 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 409 transitions. [2022-07-21 17:18:16,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2022-07-21 17:18:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 409 transitions. [2022-07-21 17:18:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 17:18:16,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:16,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:16,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:18:16,885 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash 592492778, now seen corresponding path program 1 times [2022-07-21 17:18:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:16,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692569489] [2022-07-21 17:18:16,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:16,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:16,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:16,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692569489] [2022-07-21 17:18:16,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692569489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:16,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:16,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:18:16,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725151424] [2022-07-21 17:18:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:16,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:16,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:16,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:16,938 INFO L87 Difference]: Start difference. First operand 288 states and 409 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2022-07-21 17:18:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:17,054 INFO L93 Difference]: Finished difference Result 359 states and 452 transitions. [2022-07-21 17:18:17,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:17,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 [2022-07-21 17:18:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:17,056 INFO L225 Difference]: With dead ends: 359 [2022-07-21 17:18:17,056 INFO L226 Difference]: Without dead ends: 359 [2022-07-21 17:18:17,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:17,057 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 133 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:17,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 385 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-21 17:18:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 288. [2022-07-21 17:18:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 409 transitions. [2022-07-21 17:18:17,064 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 409 transitions. Word has length 8 [2022-07-21 17:18:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:17,064 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 409 transitions. [2022-07-21 17:18:17,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2022-07-21 17:18:17,064 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 409 transitions. [2022-07-21 17:18:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:18:17,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:17,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:17,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:18:17,065 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1364890281, now seen corresponding path program 1 times [2022-07-21 17:18:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:17,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760358711] [2022-07-21 17:18:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:17,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:17,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760358711] [2022-07-21 17:18:17,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760358711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:17,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:17,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:18:17,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565935071] [2022-07-21 17:18:17,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:17,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:18:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:17,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:18:17,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:18:17,087 INFO L87 Difference]: Start difference. First operand 288 states and 409 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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) [2022-07-21 17:18:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:17,096 INFO L93 Difference]: Finished difference Result 391 states and 509 transitions. [2022-07-21 17:18:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:18:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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 [2022-07-21 17:18:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:17,099 INFO L225 Difference]: With dead ends: 391 [2022-07-21 17:18:17,100 INFO L226 Difference]: Without dead ends: 391 [2022-07-21 17:18:17,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:18:17,101 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:17,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 328 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-07-21 17:18:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 290. [2022-07-21 17:18:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 221 states have (on average 1.7782805429864252) internal successors, (393), 279 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 409 transitions. [2022-07-21 17:18:17,110 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 409 transitions. Word has length 11 [2022-07-21 17:18:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:17,110 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 409 transitions. [2022-07-21 17:18:17,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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) [2022-07-21 17:18:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 409 transitions. [2022-07-21 17:18:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 17:18:17,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:17,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:17,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 17:18:17,111 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:17,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:17,112 INFO L85 PathProgramCache]: Analyzing trace with hash 638072979, now seen corresponding path program 1 times [2022-07-21 17:18:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:17,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326497741] [2022-07-21 17:18:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:17,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326497741] [2022-07-21 17:18:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326497741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:17,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:17,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:18:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066553297] [2022-07-21 17:18:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:17,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:18:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:18:17,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:18:17,146 INFO L87 Difference]: Start difference. First operand 290 states and 409 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:18:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:17,221 INFO L93 Difference]: Finished difference Result 349 states and 466 transitions. [2022-07-21 17:18:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:18:17,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 17:18:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:17,224 INFO L225 Difference]: With dead ends: 349 [2022-07-21 17:18:17,224 INFO L226 Difference]: Without dead ends: 342 [2022-07-21 17:18:17,224 INFO L412 NwaCegarLoop]: 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 [2022-07-21 17:18:17,225 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 81 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:17,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 251 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-21 17:18:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 287. [2022-07-21 17:18:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 218 states have (on average 1.7798165137614679) internal successors, (388), 276 states have internal predecessors, (388), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 404 transitions. [2022-07-21 17:18:17,230 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 404 transitions. Word has length 12 [2022-07-21 17:18:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:17,230 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 404 transitions. [2022-07-21 17:18:17,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:18:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 404 transitions. [2022-07-21 17:18:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:18:17,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:17,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:17,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 17:18:17,232 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:17,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash -529439982, now seen corresponding path program 1 times [2022-07-21 17:18:17,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:17,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529901309] [2022-07-21 17:18:17,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:17,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:17,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529901309] [2022-07-21 17:18:17,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529901309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:17,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:17,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:18:17,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256721940] [2022-07-21 17:18:17,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:17,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:17,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:17,256 INFO L87 Difference]: Start difference. First operand 287 states and 404 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:17,272 INFO L93 Difference]: Finished difference Result 451 states and 620 transitions. [2022-07-21 17:18:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:17,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-21 17:18:17,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:17,274 INFO L225 Difference]: With dead ends: 451 [2022-07-21 17:18:17,274 INFO L226 Difference]: Without dead ends: 451 [2022-07-21 17:18:17,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:17,275 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 153 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:17,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 470 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:17,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-21 17:18:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 291. [2022-07-21 17:18:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 222 states have (on average 1.7567567567567568) internal successors, (390), 280 states have internal predecessors, (390), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:17,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 406 transitions. [2022-07-21 17:18:17,282 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 406 transitions. Word has length 14 [2022-07-21 17:18:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:17,282 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 406 transitions. [2022-07-21 17:18:17,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 406 transitions. [2022-07-21 17:18:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:18:17,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:17,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:17,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:18:17,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:17,286 INFO L85 PathProgramCache]: Analyzing trace with hash 279906644, now seen corresponding path program 1 times [2022-07-21 17:18:17,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:17,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78272591] [2022-07-21 17:18:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:17,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:17,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:17,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:17,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78272591] [2022-07-21 17:18:17,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78272591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:17,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:17,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:18:17,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757279522] [2022-07-21 17:18:17,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:17,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:17,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:17,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:17,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:17,329 INFO L87 Difference]: Start difference. First operand 291 states and 406 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:17,516 INFO L93 Difference]: Finished difference Result 422 states and 514 transitions. [2022-07-21 17:18:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-21 17:18:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:17,518 INFO L225 Difference]: With dead ends: 422 [2022-07-21 17:18:17,518 INFO L226 Difference]: Without dead ends: 422 [2022-07-21 17:18:17,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:17,519 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 281 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:17,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 381 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-21 17:18:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 291. [2022-07-21 17:18:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 222 states have (on average 1.7297297297297298) internal successors, (384), 280 states have internal predecessors, (384), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 400 transitions. [2022-07-21 17:18:17,524 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 400 transitions. Word has length 14 [2022-07-21 17:18:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:17,524 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 400 transitions. [2022-07-21 17:18:17,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 400 transitions. [2022-07-21 17:18:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:18:17,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:17,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:17,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:18:17,530 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash 279906645, now seen corresponding path program 1 times [2022-07-21 17:18:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:17,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576358879] [2022-07-21 17:18:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:17,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576358879] [2022-07-21 17:18:17,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576358879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:17,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:17,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:18:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76499097] [2022-07-21 17:18:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:17,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:18:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:17,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:18:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:18:17,607 INFO L87 Difference]: Start difference. First operand 291 states and 400 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:17,787 INFO L93 Difference]: Finished difference Result 331 states and 409 transitions. [2022-07-21 17:18:17,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:18:17,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-21 17:18:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:17,788 INFO L225 Difference]: With dead ends: 331 [2022-07-21 17:18:17,788 INFO L226 Difference]: Without dead ends: 331 [2022-07-21 17:18:17,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:18:17,789 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 103 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:17,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 657 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-21 17:18:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 295. [2022-07-21 17:18:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 226 states have (on average 1.7212389380530972) internal successors, (389), 282 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 405 transitions. [2022-07-21 17:18:17,795 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 405 transitions. Word has length 14 [2022-07-21 17:18:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:17,795 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 405 transitions. [2022-07-21 17:18:17,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 405 transitions. [2022-07-21 17:18:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:18:17,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:17,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:17,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:18:17,796 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:17,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1443078130, now seen corresponding path program 1 times [2022-07-21 17:18:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:17,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716683019] [2022-07-21 17:18:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:17,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:17,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:17,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:17,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716683019] [2022-07-21 17:18:17,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716683019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:17,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:17,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:18:17,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653424189] [2022-07-21 17:18:17,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:17,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:17,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:17,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:17,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:17,844 INFO L87 Difference]: Start difference. First operand 295 states and 405 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:18,018 INFO L93 Difference]: Finished difference Result 482 states and 619 transitions. [2022-07-21 17:18:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:18,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-21 17:18:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:18,020 INFO L225 Difference]: With dead ends: 482 [2022-07-21 17:18:18,020 INFO L226 Difference]: Without dead ends: 482 [2022-07-21 17:18:18,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:18,021 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 272 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:18,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 388 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-21 17:18:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 301. [2022-07-21 17:18:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 232 states have (on average 1.7025862068965518) internal successors, (395), 288 states have internal predecessors, (395), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2022-07-21 17:18:18,027 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 17 [2022-07-21 17:18:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:18,028 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2022-07-21 17:18:18,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2022-07-21 17:18:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:18:18,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:18,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:18,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 17:18:18,029 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:18,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1443078131, now seen corresponding path program 1 times [2022-07-21 17:18:18,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:18,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804180959] [2022-07-21 17:18:18,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:18,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:18,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:18,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804180959] [2022-07-21 17:18:18,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804180959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:18,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:18,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:18:18,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827026449] [2022-07-21 17:18:18,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:18,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:18,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:18,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:18,072 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:18,204 INFO L93 Difference]: Finished difference Result 350 states and 431 transitions. [2022-07-21 17:18:18,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:18,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-21 17:18:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:18,206 INFO L225 Difference]: With dead ends: 350 [2022-07-21 17:18:18,206 INFO L226 Difference]: Without dead ends: 350 [2022-07-21 17:18:18,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:18,207 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 190 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:18,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 392 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-21 17:18:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 301. [2022-07-21 17:18:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 232 states have (on average 1.6767241379310345) internal successors, (389), 288 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 405 transitions. [2022-07-21 17:18:18,212 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 405 transitions. Word has length 17 [2022-07-21 17:18:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:18,212 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 405 transitions. [2022-07-21 17:18:18,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 405 transitions. [2022-07-21 17:18:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:18:18,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:18,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:18,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 17:18:18,214 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash 534459326, now seen corresponding path program 1 times [2022-07-21 17:18:18,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:18,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671167315] [2022-07-21 17:18:18,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:18,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:18,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:18,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671167315] [2022-07-21 17:18:18,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671167315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:18,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:18,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:18:18,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001290937] [2022-07-21 17:18:18,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:18,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:18:18,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:18:18,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:18:18,253 INFO L87 Difference]: Start difference. First operand 301 states and 405 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:18,327 INFO L93 Difference]: Finished difference Result 397 states and 512 transitions. [2022-07-21 17:18:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:18:18,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-21 17:18:18,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:18,329 INFO L225 Difference]: With dead ends: 397 [2022-07-21 17:18:18,329 INFO L226 Difference]: Without dead ends: 397 [2022-07-21 17:18:18,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:18:18,331 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 141 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:18,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 281 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-21 17:18:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 298. [2022-07-21 17:18:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 285 states have internal predecessors, (383), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 399 transitions. [2022-07-21 17:18:18,339 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 399 transitions. Word has length 20 [2022-07-21 17:18:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:18,340 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 399 transitions. [2022-07-21 17:18:18,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 399 transitions. [2022-07-21 17:18:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:18:18,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:18,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:18,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 17:18:18,342 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash 534459327, now seen corresponding path program 1 times [2022-07-21 17:18:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:18,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128450840] [2022-07-21 17:18:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:18,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:18,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:18,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128450840] [2022-07-21 17:18:18,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128450840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:18,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:18,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:18:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638053160] [2022-07-21 17:18:18,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:18,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:18,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:18,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:18,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:18,397 INFO L87 Difference]: Start difference. First operand 298 states and 399 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:18,512 INFO L93 Difference]: Finished difference Result 517 states and 636 transitions. [2022-07-21 17:18:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-21 17:18:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:18,514 INFO L225 Difference]: With dead ends: 517 [2022-07-21 17:18:18,514 INFO L226 Difference]: Without dead ends: 517 [2022-07-21 17:18:18,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:18,515 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 376 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:18,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 456 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-21 17:18:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 301. [2022-07-21 17:18:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 236 states have (on average 1.63135593220339) internal successors, (385), 288 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 401 transitions. [2022-07-21 17:18:18,524 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 401 transitions. Word has length 20 [2022-07-21 17:18:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:18,525 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 401 transitions. [2022-07-21 17:18:18,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-07-21 17:18:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:18:18,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:18,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:18,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 17:18:18,526 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:18,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash -611630038, now seen corresponding path program 1 times [2022-07-21 17:18:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:18,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641581169] [2022-07-21 17:18:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:18,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:18,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641581169] [2022-07-21 17:18:18,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641581169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:18,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:18,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:18:18,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926297315] [2022-07-21 17:18:18,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:18,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:18,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:18,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:18,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:18,568 INFO L87 Difference]: Start difference. First operand 301 states and 401 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:18,669 INFO L93 Difference]: Finished difference Result 516 states and 634 transitions. [2022-07-21 17:18:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:18,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-21 17:18:18,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:18,672 INFO L225 Difference]: With dead ends: 516 [2022-07-21 17:18:18,672 INFO L226 Difference]: Without dead ends: 516 [2022-07-21 17:18:18,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:18,674 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 442 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:18,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 407 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-07-21 17:18:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 303. [2022-07-21 17:18:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 290 states have internal predecessors, (387), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 403 transitions. [2022-07-21 17:18:18,680 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 403 transitions. Word has length 21 [2022-07-21 17:18:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:18,681 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 403 transitions. [2022-07-21 17:18:18,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 403 transitions. [2022-07-21 17:18:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:18:18,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:18,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:18,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 17:18:18,682 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash -611574334, now seen corresponding path program 1 times [2022-07-21 17:18:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:18,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118601660] [2022-07-21 17:18:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:18,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:18,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:18,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118601660] [2022-07-21 17:18:18,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118601660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:18,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:18,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:18:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243579594] [2022-07-21 17:18:18,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:18,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:18:18,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:18,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:18:18,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:18:18,756 INFO L87 Difference]: Start difference. First operand 303 states and 403 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:18,807 INFO L93 Difference]: Finished difference Result 336 states and 405 transitions. [2022-07-21 17:18:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:18:18,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-21 17:18:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:18,809 INFO L225 Difference]: With dead ends: 336 [2022-07-21 17:18:18,809 INFO L226 Difference]: Without dead ends: 336 [2022-07-21 17:18:18,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:18:18,810 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 348 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:18,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-21 17:18:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 303. [2022-07-21 17:18:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 238 states have (on average 1.6176470588235294) internal successors, (385), 290 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 401 transitions. [2022-07-21 17:18:18,819 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 401 transitions. Word has length 21 [2022-07-21 17:18:18,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:18,819 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 401 transitions. [2022-07-21 17:18:18,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,819 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 401 transitions. [2022-07-21 17:18:18,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 17:18:18,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:18,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:18,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 17:18:18,820 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:18,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:18,821 INFO L85 PathProgramCache]: Analyzing trace with hash -611572412, now seen corresponding path program 1 times [2022-07-21 17:18:18,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:18,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557769421] [2022-07-21 17:18:18,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:18,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:18,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557769421] [2022-07-21 17:18:18,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557769421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:18,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:18,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:18:18,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790922166] [2022-07-21 17:18:18,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:18,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:18:18,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:18,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:18:18,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:18:18,891 INFO L87 Difference]: Start difference. First operand 303 states and 401 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:18,944 INFO L93 Difference]: Finished difference Result 326 states and 391 transitions. [2022-07-21 17:18:18,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:18:18,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-21 17:18:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:18,945 INFO L225 Difference]: With dead ends: 326 [2022-07-21 17:18:18,945 INFO L226 Difference]: Without dead ends: 326 [2022-07-21 17:18:18,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:18:18,946 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 337 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:18,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1130 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-21 17:18:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 293. [2022-07-21 17:18:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 280 states have internal predecessors, (371), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 17:18:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 387 transitions. [2022-07-21 17:18:18,951 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 387 transitions. Word has length 21 [2022-07-21 17:18:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:18,951 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 387 transitions. [2022-07-21 17:18:18,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 387 transitions. [2022-07-21 17:18:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 17:18:18,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:18,952 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:18:18,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 17:18:18,952 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:18,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1215813558, now seen corresponding path program 1 times [2022-07-21 17:18:18,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:18,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796340354] [2022-07-21 17:18:18,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:18,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:19,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:19,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:19,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796340354] [2022-07-21 17:18:19,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796340354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:19,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:19,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:18:19,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881065569] [2022-07-21 17:18:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:19,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:18:19,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:19,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:18:19,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:18:19,174 INFO L87 Difference]: Start difference. First operand 293 states and 387 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:19,640 INFO L93 Difference]: Finished difference Result 410 states and 523 transitions. [2022-07-21 17:18:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:18:19,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-21 17:18:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:19,642 INFO L225 Difference]: With dead ends: 410 [2022-07-21 17:18:19,642 INFO L226 Difference]: Without dead ends: 408 [2022-07-21 17:18:19,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:18:19,643 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 253 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:19,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 905 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-21 17:18:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 345. [2022-07-21 17:18:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 277 states have (on average 1.5884476534296028) internal successors, (440), 328 states have internal predecessors, (440), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-21 17:18:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 462 transitions. [2022-07-21 17:18:19,649 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 462 transitions. Word has length 23 [2022-07-21 17:18:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:19,649 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 462 transitions. [2022-07-21 17:18:19,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 462 transitions. [2022-07-21 17:18:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:18:19,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:19,650 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:18:19,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 17:18:19,650 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash 173365089, now seen corresponding path program 1 times [2022-07-21 17:18:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:19,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076891284] [2022-07-21 17:18:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:19,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:19,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:19,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:19,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076891284] [2022-07-21 17:18:19,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076891284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:19,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:19,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:18:19,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760167338] [2022-07-21 17:18:19,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:19,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:19,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:19,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:19,701 INFO L87 Difference]: Start difference. First operand 345 states and 462 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:19,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:19,839 INFO L93 Difference]: Finished difference Result 520 states and 673 transitions. [2022-07-21 17:18:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:19,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-21 17:18:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:19,841 INFO L225 Difference]: With dead ends: 520 [2022-07-21 17:18:19,842 INFO L226 Difference]: Without dead ends: 520 [2022-07-21 17:18:19,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:19,842 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 236 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:19,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 372 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-21 17:18:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 377. [2022-07-21 17:18:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 309 states have (on average 1.6181229773462784) internal successors, (500), 360 states have internal predecessors, (500), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-21 17:18:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 522 transitions. [2022-07-21 17:18:19,850 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 522 transitions. Word has length 25 [2022-07-21 17:18:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:19,850 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 522 transitions. [2022-07-21 17:18:19,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 522 transitions. [2022-07-21 17:18:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:18:19,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:19,851 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:18:19,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 17:18:19,851 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:19,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash 173365090, now seen corresponding path program 1 times [2022-07-21 17:18:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:19,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101810970] [2022-07-21 17:18:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:19,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:19,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:19,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101810970] [2022-07-21 17:18:19,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101810970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:19,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:19,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:18:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274524601] [2022-07-21 17:18:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:19,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:18:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:18:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:18:19,959 INFO L87 Difference]: Start difference. First operand 377 states and 522 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:20,177 INFO L93 Difference]: Finished difference Result 428 states and 544 transitions. [2022-07-21 17:18:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:18:20,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-21 17:18:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:20,179 INFO L225 Difference]: With dead ends: 428 [2022-07-21 17:18:20,179 INFO L226 Difference]: Without dead ends: 428 [2022-07-21 17:18:20,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:18:20,180 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 267 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:20,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 564 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-21 17:18:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 377. [2022-07-21 17:18:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 309 states have (on average 1.5792880258899675) internal successors, (488), 360 states have internal predecessors, (488), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-21 17:18:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 510 transitions. [2022-07-21 17:18:20,185 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 510 transitions. Word has length 25 [2022-07-21 17:18:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:20,186 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 510 transitions. [2022-07-21 17:18:20,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 510 transitions. [2022-07-21 17:18:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:18:20,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:20,187 INFO L195 NwaCegarLoop]: 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] [2022-07-21 17:18:20,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 17:18:20,187 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash -560017875, now seen corresponding path program 1 times [2022-07-21 17:18:20,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:20,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610834107] [2022-07-21 17:18:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:20,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:20,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:20,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610834107] [2022-07-21 17:18:20,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610834107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:20,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:20,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:18:20,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801260391] [2022-07-21 17:18:20,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:20,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:18:20,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:18:20,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:18:20,288 INFO L87 Difference]: Start difference. First operand 377 states and 510 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:20,510 INFO L93 Difference]: Finished difference Result 667 states and 867 transitions. [2022-07-21 17:18:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:18:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-21 17:18:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:20,517 INFO L225 Difference]: With dead ends: 667 [2022-07-21 17:18:20,517 INFO L226 Difference]: Without dead ends: 667 [2022-07-21 17:18:20,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:18:20,518 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 391 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:20,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1187 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-07-21 17:18:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 439. [2022-07-21 17:18:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 368 states have (on average 1.546195652173913) internal successors, (569), 419 states have internal predecessors, (569), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-21 17:18:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 595 transitions. [2022-07-21 17:18:20,525 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 595 transitions. Word has length 25 [2022-07-21 17:18:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:20,525 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 595 transitions. [2022-07-21 17:18:20,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 595 transitions. [2022-07-21 17:18:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 17:18:20,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:20,526 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-21 17:18:20,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 17:18:20,526 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:20,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1306109328, now seen corresponding path program 1 times [2022-07-21 17:18:20,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:20,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025898313] [2022-07-21 17:18:20,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:20,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:20,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:20,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:20,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025898313] [2022-07-21 17:18:20,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025898313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:20,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:20,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:18:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276619160] [2022-07-21 17:18:20,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:20,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:18:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:18:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:18:20,602 INFO L87 Difference]: Start difference. First operand 439 states and 595 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:20,810 INFO L93 Difference]: Finished difference Result 552 states and 696 transitions. [2022-07-21 17:18:20,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:18:20,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-21 17:18:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:20,813 INFO L225 Difference]: With dead ends: 552 [2022-07-21 17:18:20,813 INFO L226 Difference]: Without dead ends: 552 [2022-07-21 17:18:20,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:18:20,814 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 991 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:20,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 372 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-07-21 17:18:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 455. [2022-07-21 17:18:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 389 states have (on average 1.5295629820051413) internal successors, (595), 434 states have internal predecessors, (595), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:18:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 623 transitions. [2022-07-21 17:18:20,821 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 623 transitions. Word has length 27 [2022-07-21 17:18:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:20,821 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 623 transitions. [2022-07-21 17:18:20,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 623 transitions. [2022-07-21 17:18:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 17:18:20,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:20,822 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-07-21 17:18:20,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 17:18:20,822 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1834683473, now seen corresponding path program 1 times [2022-07-21 17:18:20,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:20,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462250546] [2022-07-21 17:18:20,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:20,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:20,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:20,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:20,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462250546] [2022-07-21 17:18:20,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462250546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:20,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:20,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:18:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68270499] [2022-07-21 17:18:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:20,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:18:20,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:20,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:18:20,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:18:20,872 INFO L87 Difference]: Start difference. First operand 455 states and 623 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:20,991 INFO L93 Difference]: Finished difference Result 480 states and 621 transitions. [2022-07-21 17:18:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:18:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-21 17:18:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:20,993 INFO L225 Difference]: With dead ends: 480 [2022-07-21 17:18:20,993 INFO L226 Difference]: Without dead ends: 480 [2022-07-21 17:18:20,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:18:20,994 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 420 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:20,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 871 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-07-21 17:18:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 453. [2022-07-21 17:18:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 389 states have (on average 1.519280205655527) internal successors, (591), 432 states have internal predecessors, (591), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:18:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 619 transitions. [2022-07-21 17:18:21,001 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 619 transitions. Word has length 28 [2022-07-21 17:18:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:21,001 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 619 transitions. [2022-07-21 17:18:21,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 619 transitions. [2022-07-21 17:18:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 17:18:21,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:21,002 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-07-21 17:18:21,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 17:18:21,002 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:21,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1486279512, now seen corresponding path program 1 times [2022-07-21 17:18:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:21,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483946205] [2022-07-21 17:18:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:21,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:21,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483946205] [2022-07-21 17:18:21,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483946205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:21,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:21,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:18:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506675994] [2022-07-21 17:18:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:21,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:18:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:18:21,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:21,043 INFO L87 Difference]: Start difference. First operand 453 states and 619 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:21,143 INFO L93 Difference]: Finished difference Result 518 states and 681 transitions. [2022-07-21 17:18:21,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:18:21,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-21 17:18:21,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:21,145 INFO L225 Difference]: With dead ends: 518 [2022-07-21 17:18:21,146 INFO L226 Difference]: Without dead ends: 518 [2022-07-21 17:18:21,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:18:21,147 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 168 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:21,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 560 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-07-21 17:18:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 453. [2022-07-21 17:18:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 432 states have internal predecessors, (589), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-21 17:18:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 617 transitions. [2022-07-21 17:18:21,154 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 617 transitions. Word has length 29 [2022-07-21 17:18:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:21,154 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 617 transitions. [2022-07-21 17:18:21,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 617 transitions. [2022-07-21 17:18:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:18:21,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:21,155 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-07-21 17:18:21,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 17:18:21,155 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1169975593, now seen corresponding path program 1 times [2022-07-21 17:18:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:21,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823455350] [2022-07-21 17:18:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:21,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823455350] [2022-07-21 17:18:21,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823455350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:21,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:21,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:18:21,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556536180] [2022-07-21 17:18:21,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:21,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:18:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:21,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:18:21,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:21,218 INFO L87 Difference]: Start difference. First operand 453 states and 617 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:21,337 INFO L93 Difference]: Finished difference Result 565 states and 746 transitions. [2022-07-21 17:18:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:18:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-21 17:18:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:21,339 INFO L225 Difference]: With dead ends: 565 [2022-07-21 17:18:21,339 INFO L226 Difference]: Without dead ends: 565 [2022-07-21 17:18:21,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:18:21,340 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 161 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:21,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 513 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-21 17:18:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 493. [2022-07-21 17:18:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 470 states have internal predecessors, (641), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 17:18:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 673 transitions. [2022-07-21 17:18:21,361 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 673 transitions. Word has length 30 [2022-07-21 17:18:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:21,361 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 673 transitions. [2022-07-21 17:18:21,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 673 transitions. [2022-07-21 17:18:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:18:21,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:21,366 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-07-21 17:18:21,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 17:18:21,366 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2100742417, now seen corresponding path program 1 times [2022-07-21 17:18:21,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:21,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100085746] [2022-07-21 17:18:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:21,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100085746] [2022-07-21 17:18:21,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100085746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:21,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:21,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:18:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420327937] [2022-07-21 17:18:21,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:21,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:18:21,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:21,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:18:21,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:18:21,485 INFO L87 Difference]: Start difference. First operand 493 states and 673 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:21,812 INFO L93 Difference]: Finished difference Result 585 states and 737 transitions. [2022-07-21 17:18:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:18:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-21 17:18:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:21,814 INFO L225 Difference]: With dead ends: 585 [2022-07-21 17:18:21,814 INFO L226 Difference]: Without dead ends: 585 [2022-07-21 17:18:21,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:18:21,815 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 779 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:21,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 740 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-07-21 17:18:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 491. [2022-07-21 17:18:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 426 states have (on average 1.4953051643192488) internal successors, (637), 468 states have internal predecessors, (637), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 17:18:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 669 transitions. [2022-07-21 17:18:21,822 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 669 transitions. Word has length 30 [2022-07-21 17:18:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:21,822 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 669 transitions. [2022-07-21 17:18:21,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 669 transitions. [2022-07-21 17:18:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 17:18:21,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:21,823 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:21,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 17:18:21,823 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash -252550768, now seen corresponding path program 1 times [2022-07-21 17:18:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:21,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569292604] [2022-07-21 17:18:21,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:21,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:21,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:21,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:21,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569292604] [2022-07-21 17:18:21,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569292604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:21,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:21,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:18:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833038864] [2022-07-21 17:18:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:21,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:18:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:21,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:18:21,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:21,856 INFO L87 Difference]: Start difference. First operand 491 states and 669 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:21,875 INFO L93 Difference]: Finished difference Result 581 states and 776 transitions. [2022-07-21 17:18:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:18:21,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-07-21 17:18:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:21,877 INFO L225 Difference]: With dead ends: 581 [2022-07-21 17:18:21,877 INFO L226 Difference]: Without dead ends: 581 [2022-07-21 17:18:21,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:18:21,877 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 196 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:21,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 630 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-07-21 17:18:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 491. [2022-07-21 17:18:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 426 states have (on average 1.4859154929577465) internal successors, (633), 468 states have internal predecessors, (633), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 17:18:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 665 transitions. [2022-07-21 17:18:21,885 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 665 transitions. Word has length 32 [2022-07-21 17:18:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:21,885 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 665 transitions. [2022-07-21 17:18:21,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 665 transitions. [2022-07-21 17:18:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 17:18:21,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:21,886 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:21,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-21 17:18:21,886 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash -252548846, now seen corresponding path program 1 times [2022-07-21 17:18:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:21,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086628247] [2022-07-21 17:18:21,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:21,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:21,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:21,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:21,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086628247] [2022-07-21 17:18:21,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086628247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:21,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:21,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:18:21,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370776757] [2022-07-21 17:18:21,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:21,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:18:21,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:21,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:18:21,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:18:21,956 INFO L87 Difference]: Start difference. First operand 491 states and 665 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:22,093 INFO L93 Difference]: Finished difference Result 750 states and 983 transitions. [2022-07-21 17:18:22,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:18:22,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-07-21 17:18:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:22,095 INFO L225 Difference]: With dead ends: 750 [2022-07-21 17:18:22,096 INFO L226 Difference]: Without dead ends: 750 [2022-07-21 17:18:22,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:18:22,096 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 464 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:22,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1000 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-07-21 17:18:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 488. [2022-07-21 17:18:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 426 states have (on average 1.4530516431924883) internal successors, (619), 465 states have internal predecessors, (619), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-21 17:18:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 651 transitions. [2022-07-21 17:18:22,109 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 651 transitions. Word has length 32 [2022-07-21 17:18:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:22,109 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 651 transitions. [2022-07-21 17:18:22,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 651 transitions. [2022-07-21 17:18:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 17:18:22,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:22,110 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:22,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-21 17:18:22,110 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:22,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:22,111 INFO L85 PathProgramCache]: Analyzing trace with hash -934879925, now seen corresponding path program 1 times [2022-07-21 17:18:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:22,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17719618] [2022-07-21 17:18:22,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:22,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:22,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:22,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17719618] [2022-07-21 17:18:22,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17719618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:22,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:22,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:18:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306466134] [2022-07-21 17:18:22,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:22,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:18:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:18:22,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:18:22,197 INFO L87 Difference]: Start difference. First operand 488 states and 651 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:22,546 INFO L93 Difference]: Finished difference Result 925 states and 1213 transitions. [2022-07-21 17:18:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:18:22,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-07-21 17:18:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:22,549 INFO L225 Difference]: With dead ends: 925 [2022-07-21 17:18:22,549 INFO L226 Difference]: Without dead ends: 925 [2022-07-21 17:18:22,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:18:22,549 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 351 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:22,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 834 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:18:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-07-21 17:18:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 557. [2022-07-21 17:18:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 489 states have (on average 1.4355828220858895) internal successors, (702), 530 states have internal predecessors, (702), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-21 17:18:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 742 transitions. [2022-07-21 17:18:22,565 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 742 transitions. Word has length 32 [2022-07-21 17:18:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:22,565 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 742 transitions. [2022-07-21 17:18:22,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 742 transitions. [2022-07-21 17:18:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:18:22,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:22,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:22,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-21 17:18:22,566 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1427861429, now seen corresponding path program 1 times [2022-07-21 17:18:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:22,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260310505] [2022-07-21 17:18:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:22,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 17:18:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:22,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260310505] [2022-07-21 17:18:22,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260310505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:22,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389064192] [2022-07-21 17:18:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:22,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:22,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:22,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:22,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 17:18:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:22,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 17:18:22,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:18:22,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:18:22,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389064192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:22,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:18:22,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-21 17:18:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200164440] [2022-07-21 17:18:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:22,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:18:22,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:22,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:18:22,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:18:22,703 INFO L87 Difference]: Start difference. First operand 557 states and 742 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:22,708 INFO L93 Difference]: Finished difference Result 566 states and 750 transitions. [2022-07-21 17:18:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:18:22,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-21 17:18:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:22,710 INFO L225 Difference]: With dead ends: 566 [2022-07-21 17:18:22,710 INFO L226 Difference]: Without dead ends: 565 [2022-07-21 17:18:22,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:18:22,710 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:22,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-21 17:18:22,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 561. [2022-07-21 17:18:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 493 states have (on average 1.4300202839756593) internal successors, (705), 534 states have internal predecessors, (705), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-21 17:18:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 745 transitions. [2022-07-21 17:18:22,718 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 745 transitions. Word has length 33 [2022-07-21 17:18:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:22,718 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 745 transitions. [2022-07-21 17:18:22,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 745 transitions. [2022-07-21 17:18:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:18:22,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:22,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:22,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:22,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:22,919 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2049457417, now seen corresponding path program 1 times [2022-07-21 17:18:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483548886] [2022-07-21 17:18:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:23,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 17:18:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:18:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:23,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483548886] [2022-07-21 17:18:23,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483548886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:23,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:23,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:18:23,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46835645] [2022-07-21 17:18:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:23,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:18:23,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:23,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:18:23,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:18:23,137 INFO L87 Difference]: Start difference. First operand 561 states and 745 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:23,622 INFO L93 Difference]: Finished difference Result 596 states and 770 transitions. [2022-07-21 17:18:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:18:23,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-21 17:18:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:23,623 INFO L225 Difference]: With dead ends: 596 [2022-07-21 17:18:23,623 INFO L226 Difference]: Without dead ends: 594 [2022-07-21 17:18:23,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:18:23,624 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 279 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:23,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1017 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-21 17:18:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 518. [2022-07-21 17:18:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 453 states have (on average 1.4216335540838851) internal successors, (644), 493 states have internal predecessors, (644), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-21 17:18:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 680 transitions. [2022-07-21 17:18:23,630 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 680 transitions. Word has length 33 [2022-07-21 17:18:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:23,631 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 680 transitions. [2022-07-21 17:18:23,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 680 transitions. [2022-07-21 17:18:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:18:23,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:23,631 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:23,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-21 17:18:23,632 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1083493612, now seen corresponding path program 1 times [2022-07-21 17:18:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:23,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014244802] [2022-07-21 17:18:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:23,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:23,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:23,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014244802] [2022-07-21 17:18:23,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014244802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:23,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:23,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:18:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372845247] [2022-07-21 17:18:23,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:23,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:18:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:18:23,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:18:23,732 INFO L87 Difference]: Start difference. First operand 518 states and 680 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:24,028 INFO L93 Difference]: Finished difference Result 668 states and 826 transitions. [2022-07-21 17:18:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:18:24,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-21 17:18:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:24,030 INFO L225 Difference]: With dead ends: 668 [2022-07-21 17:18:24,030 INFO L226 Difference]: Without dead ends: 668 [2022-07-21 17:18:24,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:18:24,031 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 410 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:24,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 673 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-07-21 17:18:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 518. [2022-07-21 17:18:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 453 states have (on average 1.4105960264900663) internal successors, (639), 493 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-21 17:18:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 675 transitions. [2022-07-21 17:18:24,039 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 675 transitions. Word has length 33 [2022-07-21 17:18:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:24,039 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 675 transitions. [2022-07-21 17:18:24,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 675 transitions. [2022-07-21 17:18:24,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 17:18:24,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:24,040 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:24,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-21 17:18:24,041 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:24,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2113699762, now seen corresponding path program 1 times [2022-07-21 17:18:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:24,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956641889] [2022-07-21 17:18:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:24,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:24,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956641889] [2022-07-21 17:18:24,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956641889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:24,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:24,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:18:24,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956848001] [2022-07-21 17:18:24,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:24,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:18:24,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:24,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:18:24,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:18:24,146 INFO L87 Difference]: Start difference. First operand 518 states and 675 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:24,294 INFO L93 Difference]: Finished difference Result 556 states and 716 transitions. [2022-07-21 17:18:24,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:18:24,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-21 17:18:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:24,296 INFO L225 Difference]: With dead ends: 556 [2022-07-21 17:18:24,296 INFO L226 Difference]: Without dead ends: 556 [2022-07-21 17:18:24,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:18:24,297 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 99 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:24,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 680 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-07-21 17:18:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 518. [2022-07-21 17:18:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 453 states have (on average 1.4061810154525387) internal successors, (637), 493 states have internal predecessors, (637), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-21 17:18:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 673 transitions. [2022-07-21 17:18:24,304 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 673 transitions. Word has length 34 [2022-07-21 17:18:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:24,305 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 673 transitions. [2022-07-21 17:18:24,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 673 transitions. [2022-07-21 17:18:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:18:24,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:24,306 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-07-21 17:18:24,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-21 17:18:24,307 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:24,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:24,307 INFO L85 PathProgramCache]: Analyzing trace with hash 949188435, now seen corresponding path program 1 times [2022-07-21 17:18:24,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:24,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381894739] [2022-07-21 17:18:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:24,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 17:18:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 17:18:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:24,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381894739] [2022-07-21 17:18:24,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381894739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:24,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:24,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:18:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030106689] [2022-07-21 17:18:24,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:24,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:18:24,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:24,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:18:24,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:18:24,338 INFO L87 Difference]: Start difference. First operand 518 states and 673 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:24,343 INFO L93 Difference]: Finished difference Result 520 states and 675 transitions. [2022-07-21 17:18:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:18:24,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-07-21 17:18:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:24,345 INFO L225 Difference]: With dead ends: 520 [2022-07-21 17:18:24,345 INFO L226 Difference]: Without dead ends: 520 [2022-07-21 17:18:24,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:18:24,346 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:24,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-21 17:18:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2022-07-21 17:18:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 455 states have (on average 1.4043956043956043) internal successors, (639), 495 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-21 17:18:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 675 transitions. [2022-07-21 17:18:24,354 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 675 transitions. Word has length 41 [2022-07-21 17:18:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:24,355 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 675 transitions. [2022-07-21 17:18:24,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 675 transitions. [2022-07-21 17:18:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:18:24,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:24,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 17:18:24,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-21 17:18:24,356 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:24,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1758535061, now seen corresponding path program 1 times [2022-07-21 17:18:24,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:24,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076368374] [2022-07-21 17:18:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:24,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:24,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 17:18:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:24,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:24,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076368374] [2022-07-21 17:18:24,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076368374] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:24,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427478659] [2022-07-21 17:18:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:24,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:24,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 17:18:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:24,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 17:18:24,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:24,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:18:25,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:18:25,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2022-07-21 17:18:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:18:25,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427478659] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:18:25,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:18:25,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 8] total 27 [2022-07-21 17:18:25,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942988498] [2022-07-21 17:18:25,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:18:25,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 17:18:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:25,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 17:18:25,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2022-07-21 17:18:25,189 INFO L87 Difference]: Start difference. First operand 520 states and 675 transitions. Second operand has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:18:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:25,512 INFO L93 Difference]: Finished difference Result 545 states and 676 transitions. [2022-07-21 17:18:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:18:25,513 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2022-07-21 17:18:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:25,514 INFO L225 Difference]: With dead ends: 545 [2022-07-21 17:18:25,514 INFO L226 Difference]: Without dead ends: 545 [2022-07-21 17:18:25,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2022-07-21 17:18:25,515 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 1697 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:25,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 1449 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-07-21 17:18:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 517. [2022-07-21 17:18:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 493 states have internal predecessors, (634), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-21 17:18:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 670 transitions. [2022-07-21 17:18:25,524 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 670 transitions. Word has length 41 [2022-07-21 17:18:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:25,525 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 670 transitions. [2022-07-21 17:18:25,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 17:18:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 670 transitions. [2022-07-21 17:18:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:18:25,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:25,525 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:25,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 17:18:25,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-21 17:18:25,744 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1516271307, now seen corresponding path program 1 times [2022-07-21 17:18:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:25,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794715299] [2022-07-21 17:18:25,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:25,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:25,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 17:18:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:25,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794715299] [2022-07-21 17:18:25,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794715299] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:25,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352337200] [2022-07-21 17:18:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:25,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:25,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 17:18:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:25,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:18:25,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:25,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:18:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:25,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352337200] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:18:25,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:18:25,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-21 17:18:25,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958430741] [2022-07-21 17:18:25,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:18:25,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:18:25,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:25,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:18:25,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:18:25,948 INFO L87 Difference]: Start difference. First operand 517 states and 670 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-21 17:18:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:25,995 INFO L93 Difference]: Finished difference Result 1213 states and 1554 transitions. [2022-07-21 17:18:25,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:18:25,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-07-21 17:18:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:25,998 INFO L225 Difference]: With dead ends: 1213 [2022-07-21 17:18:25,998 INFO L226 Difference]: Without dead ends: 1213 [2022-07-21 17:18:25,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:18:25,999 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 649 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:25,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 755 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-07-21 17:18:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 679. [2022-07-21 17:18:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 609 states have (on average 1.361247947454844) internal successors, (829), 649 states have internal predecessors, (829), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-21 17:18:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 877 transitions. [2022-07-21 17:18:26,010 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 877 transitions. Word has length 44 [2022-07-21 17:18:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:26,010 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 877 transitions. [2022-07-21 17:18:26,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-21 17:18:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 877 transitions. [2022-07-21 17:18:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 17:18:26,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:26,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:26,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:26,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:26,231 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:26,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2077631411, now seen corresponding path program 1 times [2022-07-21 17:18:26,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:26,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657528363] [2022-07-21 17:18:26,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:26,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:26,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 17:18:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:18:26,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:26,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657528363] [2022-07-21 17:18:26,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657528363] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:26,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177536182] [2022-07-21 17:18:26,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:26,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:26,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:26,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:26,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 17:18:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:26,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 17:18:26,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:26,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:18:26,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177536182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:26,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:18:26,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2022-07-21 17:18:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136517461] [2022-07-21 17:18:26,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:26,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:18:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:26,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:18:26,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:18:26,641 INFO L87 Difference]: Start difference. First operand 679 states and 877 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:26,802 INFO L93 Difference]: Finished difference Result 873 states and 1085 transitions. [2022-07-21 17:18:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:18:26,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-21 17:18:26,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:26,804 INFO L225 Difference]: With dead ends: 873 [2022-07-21 17:18:26,804 INFO L226 Difference]: Without dead ends: 873 [2022-07-21 17:18:26,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:18:26,805 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 517 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:26,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 371 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-07-21 17:18:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 676. [2022-07-21 17:18:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 609 states have (on average 1.348111658456486) internal successors, (821), 646 states have internal predecessors, (821), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-21 17:18:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 869 transitions. [2022-07-21 17:18:26,814 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 869 transitions. Word has length 44 [2022-07-21 17:18:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:26,814 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 869 transitions. [2022-07-21 17:18:26,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 869 transitions. [2022-07-21 17:18:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:18:26,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:26,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-07-21 17:18:26,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:27,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-21 17:18:27,032 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash 990140495, now seen corresponding path program 1 times [2022-07-21 17:18:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:27,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052892682] [2022-07-21 17:18:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:27,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:27,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:27,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 17:18:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:27,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:27,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052892682] [2022-07-21 17:18:27,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052892682] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:27,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909382579] [2022-07-21 17:18:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:27,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:27,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:27,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:27,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 17:18:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:27,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 17:18:27,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:27,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:18:27,299 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 17:18:27,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-07-21 17:18:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:27,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909382579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:18:27,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:18:27,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-21 17:18:27,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110978579] [2022-07-21 17:18:27,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:18:27,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:18:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:27,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:18:27,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:18:27,320 INFO L87 Difference]: Start difference. First operand 676 states and 869 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:18:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:27,766 INFO L93 Difference]: Finished difference Result 2164 states and 2713 transitions. [2022-07-21 17:18:27,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:18:27,766 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-07-21 17:18:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:27,771 INFO L225 Difference]: With dead ends: 2164 [2022-07-21 17:18:27,771 INFO L226 Difference]: Without dead ends: 2164 [2022-07-21 17:18:27,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-07-21 17:18:27,771 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 2244 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2246 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:27,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2246 Valid, 825 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:18:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2022-07-21 17:18:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 831. [2022-07-21 17:18:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 758 states have (on average 1.3007915567282322) internal successors, (986), 791 states have internal predecessors, (986), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 27 states have call predecessors, (33), 33 states have call successors, (33) [2022-07-21 17:18:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1052 transitions. [2022-07-21 17:18:27,787 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1052 transitions. Word has length 46 [2022-07-21 17:18:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:27,787 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1052 transitions. [2022-07-21 17:18:27,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:18:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1052 transitions. [2022-07-21 17:18:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:18:27,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:27,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:27,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:27,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-21 17:18:27,999 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash -201066803, now seen corresponding path program 1 times [2022-07-21 17:18:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:28,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207431800] [2022-07-21 17:18:28,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:28,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:28,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:28,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207431800] [2022-07-21 17:18:28,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207431800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:28,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046765475] [2022-07-21 17:18:28,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:28,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:28,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:28,032 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:28,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 17:18:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:28,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:18:28,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:28,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:18:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:28,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046765475] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:18:28,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:18:28,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 7 [2022-07-21 17:18:28,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275577948] [2022-07-21 17:18:28,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:18:28,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:18:28,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:28,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:18:28,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:18:28,202 INFO L87 Difference]: Start difference. First operand 831 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:18:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:28,262 INFO L93 Difference]: Finished difference Result 2728 states and 3437 transitions. [2022-07-21 17:18:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:18:28,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2022-07-21 17:18:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:28,269 INFO L225 Difference]: With dead ends: 2728 [2022-07-21 17:18:28,269 INFO L226 Difference]: Without dead ends: 2728 [2022-07-21 17:18:28,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:18:28,269 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 534 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:28,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 636 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2022-07-21 17:18:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 1906. [2022-07-21 17:18:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1774 states have (on average 1.2953776775648254) internal successors, (2298), 1811 states have internal predecessors, (2298), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-07-21 17:18:28,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2446 transitions. [2022-07-21 17:18:28,294 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2446 transitions. Word has length 45 [2022-07-21 17:18:28,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:28,295 INFO L495 AbstractCegarLoop]: Abstraction has 1906 states and 2446 transitions. [2022-07-21 17:18:28,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:18:28,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2446 transitions. [2022-07-21 17:18:28,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:18:28,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:28,296 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:28,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:28,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-21 17:18:28,507 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:28,508 INFO L85 PathProgramCache]: Analyzing trace with hash -202913845, now seen corresponding path program 1 times [2022-07-21 17:18:28,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:28,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58013144] [2022-07-21 17:18:28,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:28,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:28,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58013144] [2022-07-21 17:18:28,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58013144] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:28,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084715805] [2022-07-21 17:18:28,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:28,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:28,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:28,739 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:28,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 17:18:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:28,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:18:28,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:29,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:18:29,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084715805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:29,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:18:29,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 17 [2022-07-21 17:18:29,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406032088] [2022-07-21 17:18:29,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:29,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:18:29,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:18:29,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:18:29,021 INFO L87 Difference]: Start difference. First operand 1906 states and 2446 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:29,132 INFO L93 Difference]: Finished difference Result 1954 states and 2477 transitions. [2022-07-21 17:18:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:18:29,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-21 17:18:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:29,137 INFO L225 Difference]: With dead ends: 1954 [2022-07-21 17:18:29,137 INFO L226 Difference]: Without dead ends: 1954 [2022-07-21 17:18:29,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-07-21 17:18:29,138 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 395 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:29,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 439 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2022-07-21 17:18:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1908. [2022-07-21 17:18:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1776 states have (on average 1.2956081081081081) internal successors, (2301), 1813 states have internal predecessors, (2301), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-07-21 17:18:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2449 transitions. [2022-07-21 17:18:29,159 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2449 transitions. Word has length 45 [2022-07-21 17:18:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:29,160 INFO L495 AbstractCegarLoop]: Abstraction has 1908 states and 2449 transitions. [2022-07-21 17:18:29,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2449 transitions. [2022-07-21 17:18:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:18:29,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:29,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:29,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-21 17:18:29,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:29,375 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:29,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash -202913783, now seen corresponding path program 1 times [2022-07-21 17:18:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:29,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268172451] [2022-07-21 17:18:29,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:29,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:29,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268172451] [2022-07-21 17:18:29,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268172451] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:29,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441809238] [2022-07-21 17:18:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:29,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:29,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:29,484 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:29,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 17:18:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:29,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:18:29,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:29,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:18:29,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441809238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:29,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:18:29,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2022-07-21 17:18:29,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779763959] [2022-07-21 17:18:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:29,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:18:29,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:29,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:18:29,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:18:29,776 INFO L87 Difference]: Start difference. First operand 1908 states and 2449 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:29,892 INFO L93 Difference]: Finished difference Result 1953 states and 2475 transitions. [2022-07-21 17:18:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:18:29,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-21 17:18:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:29,896 INFO L225 Difference]: With dead ends: 1953 [2022-07-21 17:18:29,896 INFO L226 Difference]: Without dead ends: 1953 [2022-07-21 17:18:29,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:18:29,896 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 284 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:29,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 460 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2022-07-21 17:18:29,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1905. [2022-07-21 17:18:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1774 states have (on average 1.294250281848929) internal successors, (2296), 1810 states have internal predecessors, (2296), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-07-21 17:18:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2444 transitions. [2022-07-21 17:18:29,918 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2444 transitions. Word has length 45 [2022-07-21 17:18:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:29,918 INFO L495 AbstractCegarLoop]: Abstraction has 1905 states and 2444 transitions. [2022-07-21 17:18:29,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2444 transitions. [2022-07-21 17:18:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:18:29,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:29,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:29,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-21 17:18:30,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-07-21 17:18:30,136 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1987177000, now seen corresponding path program 1 times [2022-07-21 17:18:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:30,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385051118] [2022-07-21 17:18:30,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:30,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:30,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:30,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:30,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385051118] [2022-07-21 17:18:30,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385051118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:30,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:30,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-21 17:18:30,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518438153] [2022-07-21 17:18:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:30,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 17:18:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:30,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 17:18:30,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:18:30,373 INFO L87 Difference]: Start difference. First operand 1905 states and 2444 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:30,908 INFO L93 Difference]: Finished difference Result 2115 states and 2684 transitions. [2022-07-21 17:18:30,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 17:18:30,913 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-07-21 17:18:30,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:30,916 INFO L225 Difference]: With dead ends: 2115 [2022-07-21 17:18:30,916 INFO L226 Difference]: Without dead ends: 2115 [2022-07-21 17:18:30,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2022-07-21 17:18:30,917 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 1130 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:30,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1128 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:18:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2022-07-21 17:18:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1965. [2022-07-21 17:18:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1827 states have (on average 1.2939244663382594) internal successors, (2364), 1864 states have internal predecessors, (2364), 78 states have call successors, (78), 34 states have call predecessors, (78), 34 states have return successors, (78), 66 states have call predecessors, (78), 78 states have call successors, (78) [2022-07-21 17:18:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2520 transitions. [2022-07-21 17:18:30,938 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2520 transitions. Word has length 48 [2022-07-21 17:18:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:30,939 INFO L495 AbstractCegarLoop]: Abstraction has 1965 states and 2520 transitions. [2022-07-21 17:18:30,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2520 transitions. [2022-07-21 17:18:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:18:30,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:30,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:30,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-21 17:18:30,940 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:30,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1987176999, now seen corresponding path program 1 times [2022-07-21 17:18:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:30,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863965882] [2022-07-21 17:18:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:31,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:31,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863965882] [2022-07-21 17:18:31,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863965882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:31,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:31,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-21 17:18:31,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94247910] [2022-07-21 17:18:31,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:31,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 17:18:31,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:31,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 17:18:31,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:18:31,369 INFO L87 Difference]: Start difference. First operand 1965 states and 2520 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:32,041 INFO L93 Difference]: Finished difference Result 2303 states and 2927 transitions. [2022-07-21 17:18:32,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 17:18:32,042 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-07-21 17:18:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:32,045 INFO L225 Difference]: With dead ends: 2303 [2022-07-21 17:18:32,045 INFO L226 Difference]: Without dead ends: 2303 [2022-07-21 17:18:32,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2022-07-21 17:18:32,046 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1560 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:32,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 1037 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:18:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2022-07-21 17:18:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2169. [2022-07-21 17:18:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2015 states have (on average 1.3076923076923077) internal successors, (2635), 2056 states have internal predecessors, (2635), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 72 states have call predecessors, (88), 88 states have call successors, (88) [2022-07-21 17:18:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2811 transitions. [2022-07-21 17:18:32,067 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2811 transitions. Word has length 48 [2022-07-21 17:18:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:32,067 INFO L495 AbstractCegarLoop]: Abstraction has 2169 states and 2811 transitions. [2022-07-21 17:18:32,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2811 transitions. [2022-07-21 17:18:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 17:18:32,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:32,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:32,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-21 17:18:32,079 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:32,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:32,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1985329958, now seen corresponding path program 1 times [2022-07-21 17:18:32,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:32,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277384323] [2022-07-21 17:18:32,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:32,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:32,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:32,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:32,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277384323] [2022-07-21 17:18:32,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277384323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:32,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:32,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-21 17:18:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223276883] [2022-07-21 17:18:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:32,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 17:18:32,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:32,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 17:18:32,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:18:32,815 INFO L87 Difference]: Start difference. First operand 2169 states and 2811 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:33,429 INFO L93 Difference]: Finished difference Result 2215 states and 2859 transitions. [2022-07-21 17:18:33,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:18:33,429 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-07-21 17:18:33,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:33,432 INFO L225 Difference]: With dead ends: 2215 [2022-07-21 17:18:33,432 INFO L226 Difference]: Without dead ends: 2215 [2022-07-21 17:18:33,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2022-07-21 17:18:33,433 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 102 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:33,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 855 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2022-07-21 17:18:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2201. [2022-07-21 17:18:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2201 states, 2047 states have (on average 1.3043478260869565) internal successors, (2670), 2088 states have internal predecessors, (2670), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 72 states have call predecessors, (88), 88 states have call successors, (88) [2022-07-21 17:18:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 2846 transitions. [2022-07-21 17:18:33,452 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 2846 transitions. Word has length 48 [2022-07-21 17:18:33,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:33,453 INFO L495 AbstractCegarLoop]: Abstraction has 2201 states and 2846 transitions. [2022-07-21 17:18:33,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 2846 transitions. [2022-07-21 17:18:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:18:33,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:33,454 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:33,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-21 17:18:33,454 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:33,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash -894968564, now seen corresponding path program 1 times [2022-07-21 17:18:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:33,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970559538] [2022-07-21 17:18:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:33,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:33,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:33,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970559538] [2022-07-21 17:18:33,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970559538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:33,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:33,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:18:33,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256813354] [2022-07-21 17:18:33,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:33,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:18:33,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:33,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:18:33,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:18:33,641 INFO L87 Difference]: Start difference. First operand 2201 states and 2846 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:34,109 INFO L93 Difference]: Finished difference Result 2921 states and 3720 transitions. [2022-07-21 17:18:34,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 17:18:34,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-07-21 17:18:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:34,112 INFO L225 Difference]: With dead ends: 2921 [2022-07-21 17:18:34,112 INFO L226 Difference]: Without dead ends: 2921 [2022-07-21 17:18:34,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2022-07-21 17:18:34,113 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 984 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:34,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1318 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:18:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2022-07-21 17:18:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2503. [2022-07-21 17:18:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2503 states, 2311 states have (on average 1.3033318909562959) internal successors, (3012), 2376 states have internal predecessors, (3012), 119 states have call successors, (119), 47 states have call predecessors, (119), 47 states have return successors, (119), 79 states have call predecessors, (119), 119 states have call successors, (119) [2022-07-21 17:18:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 3250 transitions. [2022-07-21 17:18:34,135 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 3250 transitions. Word has length 49 [2022-07-21 17:18:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:34,135 INFO L495 AbstractCegarLoop]: Abstraction has 2503 states and 3250 transitions. [2022-07-21 17:18:34,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 3250 transitions. [2022-07-21 17:18:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:18:34,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:34,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:34,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-21 17:18:34,136 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:34,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash -894968563, now seen corresponding path program 1 times [2022-07-21 17:18:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:34,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753142823] [2022-07-21 17:18:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:34,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:34,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:34,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753142823] [2022-07-21 17:18:34,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753142823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:34,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:34,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:18:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327212196] [2022-07-21 17:18:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:34,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:18:34,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:18:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:18:34,324 INFO L87 Difference]: Start difference. First operand 2503 states and 3250 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:34,753 INFO L93 Difference]: Finished difference Result 3034 states and 3868 transitions. [2022-07-21 17:18:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 17:18:34,753 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-07-21 17:18:34,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:34,756 INFO L225 Difference]: With dead ends: 3034 [2022-07-21 17:18:34,757 INFO L226 Difference]: Without dead ends: 3034 [2022-07-21 17:18:34,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2022-07-21 17:18:34,757 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1071 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:34,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 874 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2022-07-21 17:18:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2696. [2022-07-21 17:18:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2488 states have (on average 1.3135048231511255) internal successors, (3268), 2557 states have internal predecessors, (3268), 129 states have call successors, (129), 53 states have call predecessors, (129), 53 states have return successors, (129), 85 states have call predecessors, (129), 129 states have call successors, (129) [2022-07-21 17:18:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3526 transitions. [2022-07-21 17:18:34,786 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3526 transitions. Word has length 49 [2022-07-21 17:18:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:34,786 INFO L495 AbstractCegarLoop]: Abstraction has 2696 states and 3526 transitions. [2022-07-21 17:18:34,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3526 transitions. [2022-07-21 17:18:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 17:18:34,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:34,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:34,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-21 17:18:34,788 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2031481280, now seen corresponding path program 1 times [2022-07-21 17:18:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:34,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868077879] [2022-07-21 17:18:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:34,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:34,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:34,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868077879] [2022-07-21 17:18:34,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868077879] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:34,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156374941] [2022-07-21 17:18:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:34,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:34,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:34,817 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:34,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 17:18:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:34,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:18:34,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:34,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:18:34,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156374941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:34,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:18:34,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-07-21 17:18:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952978931] [2022-07-21 17:18:34,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:34,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:34,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:34,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:34,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:34,956 INFO L87 Difference]: Start difference. First operand 2696 states and 3526 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:34,974 INFO L93 Difference]: Finished difference Result 3305 states and 4345 transitions. [2022-07-21 17:18:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:34,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-07-21 17:18:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:34,979 INFO L225 Difference]: With dead ends: 3305 [2022-07-21 17:18:34,979 INFO L226 Difference]: Without dead ends: 3305 [2022-07-21 17:18:34,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:34,980 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 213 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:34,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 337 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2022-07-21 17:18:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3181. [2022-07-21 17:18:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3181 states, 2959 states have (on average 1.3264616424467726) internal successors, (3925), 3028 states have internal predecessors, (3925), 143 states have call successors, (143), 53 states have call predecessors, (143), 53 states have return successors, (143), 99 states have call predecessors, (143), 143 states have call successors, (143) [2022-07-21 17:18:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4211 transitions. [2022-07-21 17:18:35,009 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4211 transitions. Word has length 50 [2022-07-21 17:18:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:35,009 INFO L495 AbstractCegarLoop]: Abstraction has 3181 states and 4211 transitions. [2022-07-21 17:18:35,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4211 transitions. [2022-07-21 17:18:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 17:18:35,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:35,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:35,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:35,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-07-21 17:18:35,219 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:35,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:35,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1111433432, now seen corresponding path program 1 times [2022-07-21 17:18:35,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:35,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299686390] [2022-07-21 17:18:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:35,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:35,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 17:18:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:35,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:35,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299686390] [2022-07-21 17:18:35,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299686390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:35,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:35,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-21 17:18:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147026812] [2022-07-21 17:18:35,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:35,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 17:18:35,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:35,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 17:18:35,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:18:35,677 INFO L87 Difference]: Start difference. First operand 3181 states and 4211 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:36,782 INFO L93 Difference]: Finished difference Result 3476 states and 4504 transitions. [2022-07-21 17:18:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 17:18:36,782 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-21 17:18:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:36,789 INFO L225 Difference]: With dead ends: 3476 [2022-07-21 17:18:36,789 INFO L226 Difference]: Without dead ends: 3474 [2022-07-21 17:18:36,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2022-07-21 17:18:36,790 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 1261 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:36,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 2126 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:18:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2022-07-21 17:18:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3142. [2022-07-21 17:18:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 2923 states have (on average 1.3243243243243243) internal successors, (3871), 2991 states have internal predecessors, (3871), 141 states have call successors, (141), 52 states have call predecessors, (141), 52 states have return successors, (141), 98 states have call predecessors, (141), 141 states have call successors, (141) [2022-07-21 17:18:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 4153 transitions. [2022-07-21 17:18:36,821 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 4153 transitions. Word has length 51 [2022-07-21 17:18:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:36,821 INFO L495 AbstractCegarLoop]: Abstraction has 3142 states and 4153 transitions. [2022-07-21 17:18:36,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 4153 transitions. [2022-07-21 17:18:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 17:18:36,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:36,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:36,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-21 17:18:36,823 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash -38812235, now seen corresponding path program 1 times [2022-07-21 17:18:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:36,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845908807] [2022-07-21 17:18:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:36,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:36,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:36,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845908807] [2022-07-21 17:18:36,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845908807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:36,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:36,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:18:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546013137] [2022-07-21 17:18:36,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:36,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:18:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:36,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:18:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:36,858 INFO L87 Difference]: Start difference. First operand 3142 states and 4153 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:36,873 INFO L93 Difference]: Finished difference Result 3700 states and 4965 transitions. [2022-07-21 17:18:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:18:36,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-07-21 17:18:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:36,877 INFO L225 Difference]: With dead ends: 3700 [2022-07-21 17:18:36,877 INFO L226 Difference]: Without dead ends: 3700 [2022-07-21 17:18:36,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:18:36,878 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 122 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:36,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 461 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2022-07-21 17:18:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 2749. [2022-07-21 17:18:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2749 states, 2554 states have (on average 1.308535630383712) internal successors, (3342), 2618 states have internal predecessors, (3342), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 87 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-21 17:18:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 3594 transitions. [2022-07-21 17:18:36,904 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 3594 transitions. Word has length 51 [2022-07-21 17:18:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:36,904 INFO L495 AbstractCegarLoop]: Abstraction has 2749 states and 3594 transitions. [2022-07-21 17:18:36,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3594 transitions. [2022-07-21 17:18:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 17:18:36,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:36,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:36,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-21 17:18:36,905 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash -86585480, now seen corresponding path program 1 times [2022-07-21 17:18:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:36,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890401203] [2022-07-21 17:18:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:36,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:36,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890401203] [2022-07-21 17:18:36,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890401203] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:36,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380029830] [2022-07-21 17:18:36,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:36,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:36,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:36,971 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:36,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 17:18:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:37,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 17:18:37,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:37,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:18:37,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-21 17:18:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:18:37,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:18:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:18:37,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380029830] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:18:37,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:18:37,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2022-07-21 17:18:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136614531] [2022-07-21 17:18:37,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:18:37,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 17:18:37,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 17:18:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:18:37,421 INFO L87 Difference]: Start difference. First operand 2749 states and 3594 transitions. Second operand has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:18:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:37,927 INFO L93 Difference]: Finished difference Result 3759 states and 4929 transitions. [2022-07-21 17:18:37,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 17:18:37,927 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2022-07-21 17:18:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:37,932 INFO L225 Difference]: With dead ends: 3759 [2022-07-21 17:18:37,932 INFO L226 Difference]: Without dead ends: 3751 [2022-07-21 17:18:37,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-21 17:18:37,933 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 631 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:37,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1717 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:18:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2022-07-21 17:18:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 2761. [2022-07-21 17:18:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2566 states have (on average 1.3059236165237724) internal successors, (3351), 2630 states have internal predecessors, (3351), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 87 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-21 17:18:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3603 transitions. [2022-07-21 17:18:37,961 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3603 transitions. Word has length 52 [2022-07-21 17:18:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:37,961 INFO L495 AbstractCegarLoop]: Abstraction has 2761 states and 3603 transitions. [2022-07-21 17:18:37,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:18:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3603 transitions. [2022-07-21 17:18:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 17:18:37,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:37,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:37,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:38,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-21 17:18:38,175 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:38,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:38,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1958066468, now seen corresponding path program 1 times [2022-07-21 17:18:38,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:38,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542883143] [2022-07-21 17:18:38,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:38,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:38,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542883143] [2022-07-21 17:18:38,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542883143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:38,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:38,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-21 17:18:38,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472520843] [2022-07-21 17:18:38,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:38,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 17:18:38,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:38,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 17:18:38,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:18:38,528 INFO L87 Difference]: Start difference. First operand 2761 states and 3603 transitions. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:39,481 INFO L93 Difference]: Finished difference Result 2946 states and 3803 transitions. [2022-07-21 17:18:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 17:18:39,482 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-07-21 17:18:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:39,486 INFO L225 Difference]: With dead ends: 2946 [2022-07-21 17:18:39,486 INFO L226 Difference]: Without dead ends: 2946 [2022-07-21 17:18:39,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2022-07-21 17:18:39,488 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1251 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:39,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1246 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:18:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2022-07-21 17:18:39,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2775. [2022-07-21 17:18:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2580 states have (on average 1.3058139534883721) internal successors, (3369), 2644 states have internal predecessors, (3369), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 87 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-21 17:18:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3621 transitions. [2022-07-21 17:18:39,516 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3621 transitions. Word has length 52 [2022-07-21 17:18:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:39,516 INFO L495 AbstractCegarLoop]: Abstraction has 2775 states and 3621 transitions. [2022-07-21 17:18:39,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3621 transitions. [2022-07-21 17:18:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 17:18:39,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:39,518 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:39,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-07-21 17:18:39,518 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1148719842, now seen corresponding path program 1 times [2022-07-21 17:18:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:39,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703853898] [2022-07-21 17:18:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:39,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:39,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:39,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703853898] [2022-07-21 17:18:39,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703853898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:39,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:39,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:18:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814947114] [2022-07-21 17:18:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:39,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:18:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:18:39,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:18:39,673 INFO L87 Difference]: Start difference. First operand 2775 states and 3621 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:40,059 INFO L93 Difference]: Finished difference Result 3193 states and 4105 transitions. [2022-07-21 17:18:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 17:18:40,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-07-21 17:18:40,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:40,064 INFO L225 Difference]: With dead ends: 3193 [2022-07-21 17:18:40,064 INFO L226 Difference]: Without dead ends: 3193 [2022-07-21 17:18:40,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2022-07-21 17:18:40,064 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1129 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:40,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 856 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:18:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2022-07-21 17:18:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2762. [2022-07-21 17:18:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2567 states have (on average 1.3058044409816907) internal successors, (3352), 2631 states have internal predecessors, (3352), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 87 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-21 17:18:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 3604 transitions. [2022-07-21 17:18:40,101 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 3604 transitions. Word has length 52 [2022-07-21 17:18:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:40,102 INFO L495 AbstractCegarLoop]: Abstraction has 2762 states and 3604 transitions. [2022-07-21 17:18:40,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:18:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 3604 transitions. [2022-07-21 17:18:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 17:18:40,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:40,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:40,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-07-21 17:18:40,103 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:40,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1366968916, now seen corresponding path program 1 times [2022-07-21 17:18:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:40,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157707165] [2022-07-21 17:18:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:40,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 17:18:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:18:40,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:40,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157707165] [2022-07-21 17:18:40,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157707165] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:40,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773657065] [2022-07-21 17:18:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:40,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:40,238 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:40,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 17:18:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:40,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 17:18:40,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:40,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:18:40,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773657065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:40,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:18:40,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 16 [2022-07-21 17:18:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688894298] [2022-07-21 17:18:40,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:40,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:18:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:40,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:18:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:18:40,607 INFO L87 Difference]: Start difference. First operand 2762 states and 3604 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:40,896 INFO L93 Difference]: Finished difference Result 3180 states and 4095 transitions. [2022-07-21 17:18:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:18:40,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-07-21 17:18:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:40,901 INFO L225 Difference]: With dead ends: 3180 [2022-07-21 17:18:40,902 INFO L226 Difference]: Without dead ends: 3180 [2022-07-21 17:18:40,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-07-21 17:18:40,902 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 469 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:40,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 524 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2022-07-21 17:18:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2760. [2022-07-21 17:18:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2760 states, 2567 states have (on average 1.2987923646279704) internal successors, (3334), 2629 states have internal predecessors, (3334), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 87 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-21 17:18:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3586 transitions. [2022-07-21 17:18:40,938 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3586 transitions. Word has length 53 [2022-07-21 17:18:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:40,939 INFO L495 AbstractCegarLoop]: Abstraction has 2760 states and 3586 transitions. [2022-07-21 17:18:40,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3586 transitions. [2022-07-21 17:18:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 17:18:40,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:40,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:40,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:41,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-07-21 17:18:41,158 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:41,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:41,158 INFO L85 PathProgramCache]: Analyzing trace with hash 633585951, now seen corresponding path program 1 times [2022-07-21 17:18:41,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:41,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636571577] [2022-07-21 17:18:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:41,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:41,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 17:18:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:18:41,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:41,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636571577] [2022-07-21 17:18:41,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636571577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:41,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522395174] [2022-07-21 17:18:41,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:41,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:41,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:41,533 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:41,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 17:18:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:41,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-21 17:18:41,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:41,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:18:41,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-21 17:18:42,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:18:42,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-21 17:18:42,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-21 17:18:42,153 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:18:42,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:18:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:42,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:18:42,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522395174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:42,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:18:42,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2022-07-21 17:18:42,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589879734] [2022-07-21 17:18:42,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:18:42,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-21 17:18:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-21 17:18:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 17:18:42,313 INFO L87 Difference]: Start difference. First operand 2760 states and 3586 transitions. Second operand has 32 states, 31 states have (on average 3.0) internal successors, (93), 29 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:18:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:43,816 INFO L93 Difference]: Finished difference Result 3760 states and 4886 transitions. [2022-07-21 17:18:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 17:18:43,816 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 29 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2022-07-21 17:18:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:43,821 INFO L225 Difference]: With dead ends: 3760 [2022-07-21 17:18:43,822 INFO L226 Difference]: Without dead ends: 3760 [2022-07-21 17:18:43,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=801, Invalid=2739, Unknown=0, NotChecked=0, Total=3540 [2022-07-21 17:18:43,822 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 2001 mSDsluCounter, 2464 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:43,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 2670 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 17:18:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-07-21 17:18:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 2786. [2022-07-21 17:18:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2593 states have (on average 1.2892402622445045) internal successors, (3343), 2653 states have internal predecessors, (3343), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 89 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-21 17:18:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 3595 transitions. [2022-07-21 17:18:43,853 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 3595 transitions. Word has length 53 [2022-07-21 17:18:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:43,854 INFO L495 AbstractCegarLoop]: Abstraction has 2786 states and 3595 transitions. [2022-07-21 17:18:43,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 29 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:18:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 3595 transitions. [2022-07-21 17:18:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 17:18:43,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:43,855 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:43,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:44,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-07-21 17:18:44,072 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash 633585952, now seen corresponding path program 1 times [2022-07-21 17:18:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:44,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755088015] [2022-07-21 17:18:44,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:44,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 17:18:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:18:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:44,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755088015] [2022-07-21 17:18:44,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755088015] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:44,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200760666] [2022-07-21 17:18:44,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:44,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:44,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:44,500 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:44,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 17:18:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:44,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-21 17:18:44,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:44,781 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:18:44,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:18:44,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 17:18:44,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:18:44,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:18:44,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:18:44,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:18:44,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:18:44,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:18:45,200 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-21 17:18:45,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-21 17:18:45,210 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 17:18:45,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-21 17:18:45,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:18:45,463 INFO L356 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-07-21 17:18:45,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 63 [2022-07-21 17:18:45,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:18:45,475 INFO L356 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-07-21 17:18:45,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-07-21 17:18:45,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:18:45,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-21 17:18:45,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:18:45,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2022-07-21 17:18:45,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:18:45,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:18:45,920 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:18:45,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:18:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:46,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:18:46,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200760666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:46,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:18:46,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 32 [2022-07-21 17:18:46,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239224235] [2022-07-21 17:18:46,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:18:46,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 17:18:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:46,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 17:18:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1403, Unknown=0, NotChecked=0, Total=1560 [2022-07-21 17:18:46,469 INFO L87 Difference]: Start difference. First operand 2786 states and 3595 transitions. Second operand has 33 states, 32 states have (on average 3.0625) internal successors, (98), 31 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:18:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:48,751 INFO L93 Difference]: Finished difference Result 5615 states and 7216 transitions. [2022-07-21 17:18:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-21 17:18:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.0625) internal successors, (98), 31 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2022-07-21 17:18:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:48,760 INFO L225 Difference]: With dead ends: 5615 [2022-07-21 17:18:48,760 INFO L226 Difference]: Without dead ends: 5615 [2022-07-21 17:18:48,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=647, Invalid=5205, Unknown=0, NotChecked=0, Total=5852 [2022-07-21 17:18:48,761 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 653 mSDsluCounter, 3928 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 4160 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1152 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:48,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 4160 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1212 Invalid, 0 Unknown, 1152 Unchecked, 0.6s Time] [2022-07-21 17:18:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5615 states. [2022-07-21 17:18:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5615 to 4813. [2022-07-21 17:18:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4813 states, 4502 states have (on average 1.286539315859618) internal successors, (5792), 4591 states have internal predecessors, (5792), 225 states have call successors, (225), 62 states have call predecessors, (225), 62 states have return successors, (225), 159 states have call predecessors, (225), 225 states have call successors, (225) [2022-07-21 17:18:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 6242 transitions. [2022-07-21 17:18:48,803 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 6242 transitions. Word has length 53 [2022-07-21 17:18:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:48,803 INFO L495 AbstractCegarLoop]: Abstraction has 4813 states and 6242 transitions. [2022-07-21 17:18:48,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.0625) internal successors, (98), 31 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:18:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 6242 transitions. [2022-07-21 17:18:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 17:18:48,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:48,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-07-21 17:18:48,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:49,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-07-21 17:18:49,014 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:49,015 INFO L85 PathProgramCache]: Analyzing trace with hash 385346035, now seen corresponding path program 1 times [2022-07-21 17:18:49,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:49,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138023450] [2022-07-21 17:18:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:49,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 17:18:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:49,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 17:18:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:49,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:49,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138023450] [2022-07-21 17:18:49,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138023450] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:49,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177972005] [2022-07-21 17:18:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:49,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:49,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:49,085 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:49,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 17:18:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:49,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 17:18:49,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:49,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:18:49,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-21 17:18:49,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:18:49,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-21 17:18:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:49,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:18:49,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177972005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:49,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:18:49,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2022-07-21 17:18:49,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783430619] [2022-07-21 17:18:49,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:49,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:18:49,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:49,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:18:49,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:18:49,303 INFO L87 Difference]: Start difference. First operand 4813 states and 6242 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:49,515 INFO L93 Difference]: Finished difference Result 4903 states and 6323 transitions. [2022-07-21 17:18:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:18:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-21 17:18:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:49,520 INFO L225 Difference]: With dead ends: 4903 [2022-07-21 17:18:49,520 INFO L226 Difference]: Without dead ends: 4903 [2022-07-21 17:18:49,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:18:49,521 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 220 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:49,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1101 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4903 states. [2022-07-21 17:18:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4903 to 4246. [2022-07-21 17:18:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4246 states, 3975 states have (on average 1.2827672955974843) internal successors, (5099), 4054 states have internal predecessors, (5099), 200 states have call successors, (200), 47 states have call predecessors, (200), 47 states have return successors, (200), 144 states have call predecessors, (200), 200 states have call successors, (200) [2022-07-21 17:18:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4246 states to 4246 states and 5499 transitions. [2022-07-21 17:18:49,562 INFO L78 Accepts]: Start accepts. Automaton has 4246 states and 5499 transitions. Word has length 54 [2022-07-21 17:18:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:49,562 INFO L495 AbstractCegarLoop]: Abstraction has 4246 states and 5499 transitions. [2022-07-21 17:18:49,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 5499 transitions. [2022-07-21 17:18:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-21 17:18:49,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:49,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:49,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:49,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:49,781 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash -885676746, now seen corresponding path program 1 times [2022-07-21 17:18:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:49,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766859571] [2022-07-21 17:18:49,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:49,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:50,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 17:18:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:18:50,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:50,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766859571] [2022-07-21 17:18:50,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766859571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:18:50,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:18:50,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 17:18:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019723024] [2022-07-21 17:18:50,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:18:50,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:18:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:50,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:18:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:18:50,017 INFO L87 Difference]: Start difference. First operand 4246 states and 5499 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:50,201 INFO L93 Difference]: Finished difference Result 4342 states and 5588 transitions. [2022-07-21 17:18:50,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 17:18:50,201 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-21 17:18:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:50,205 INFO L225 Difference]: With dead ends: 4342 [2022-07-21 17:18:50,205 INFO L226 Difference]: Without dead ends: 4342 [2022-07-21 17:18:50,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:18:50,206 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 1245 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:50,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 384 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:18:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2022-07-21 17:18:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4191. [2022-07-21 17:18:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4191 states, 3921 states have (on average 1.2713593471053302) internal successors, (4985), 4000 states have internal predecessors, (4985), 199 states have call successors, (199), 47 states have call predecessors, (199), 47 states have return successors, (199), 143 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-21 17:18:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 5383 transitions. [2022-07-21 17:18:50,240 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 5383 transitions. Word has length 54 [2022-07-21 17:18:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:50,240 INFO L495 AbstractCegarLoop]: Abstraction has 4191 states and 5383 transitions. [2022-07-21 17:18:50,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 5383 transitions. [2022-07-21 17:18:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 17:18:50,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:50,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:50,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-07-21 17:18:50,241 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:50,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1487364529, now seen corresponding path program 1 times [2022-07-21 17:18:50,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:50,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694823843] [2022-07-21 17:18:50,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:50,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:50,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694823843] [2022-07-21 17:18:50,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694823843] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:50,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554656009] [2022-07-21 17:18:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:50,272 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:50,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-21 17:18:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:50,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:18:50,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:50,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:18:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:50,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554656009] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:18:50,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:18:50,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-07-21 17:18:50,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460678747] [2022-07-21 17:18:50,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:18:50,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:18:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:18:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:18:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:50,477 INFO L87 Difference]: Start difference. First operand 4191 states and 5383 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:18:50,515 INFO L93 Difference]: Finished difference Result 8538 states and 11073 transitions. [2022-07-21 17:18:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:18:50,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-07-21 17:18:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:18:50,523 INFO L225 Difference]: With dead ends: 8538 [2022-07-21 17:18:50,523 INFO L226 Difference]: Without dead ends: 8538 [2022-07-21 17:18:50,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:18:50,524 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 279 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:18:50,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 658 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:18:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8538 states. [2022-07-21 17:18:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 6614. [2022-07-21 17:18:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6614 states, 6239 states have (on average 1.2875460811027408) internal successors, (8033), 6330 states have internal predecessors, (8033), 304 states have call successors, (304), 47 states have call predecessors, (304), 47 states have return successors, (304), 236 states have call predecessors, (304), 304 states have call successors, (304) [2022-07-21 17:18:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6614 states to 6614 states and 8641 transitions. [2022-07-21 17:18:50,616 INFO L78 Accepts]: Start accepts. Automaton has 6614 states and 8641 transitions. Word has length 55 [2022-07-21 17:18:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:18:50,616 INFO L495 AbstractCegarLoop]: Abstraction has 6614 states and 8641 transitions. [2022-07-21 17:18:50,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:18:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6614 states and 8641 transitions. [2022-07-21 17:18:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-21 17:18:50,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:18:50,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:18:50,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-21 17:18:50,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:50,825 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:18:50,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:18:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1136338587, now seen corresponding path program 1 times [2022-07-21 17:18:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:18:50,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413070024] [2022-07-21 17:18:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:18:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:51,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:18:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:51,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:18:51,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413070024] [2022-07-21 17:18:51,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413070024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:18:51,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691005454] [2022-07-21 17:18:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:18:51,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:18:51,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:18:51,229 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:18:51,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-21 17:18:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:18:51,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-21 17:18:51,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:18:51,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:18:51,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:18:51,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:18:51,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:18:51,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:18:51,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:18:51,800 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-21 17:18:51,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-21 17:18:52,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:18:52,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:18:52,065 INFO L356 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-07-21 17:18:52,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 77 [2022-07-21 17:18:52,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:18:52,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-07-21 17:18:52,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:18:52,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-07-21 17:18:52,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 17:18:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:18:52,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:18:52,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:18:52,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2022-07-21 17:19:04,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691005454] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:04,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:19:04,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 33 [2022-07-21 17:19:04,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470533415] [2022-07-21 17:19:04,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:19:04,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 17:19:04,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:19:04,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 17:19:04,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2073, Unknown=11, NotChecked=0, Total=2256 [2022-07-21 17:19:04,482 INFO L87 Difference]: Start difference. First operand 6614 states and 8641 transitions. Second operand has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 32 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:19:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:19:05,656 INFO L93 Difference]: Finished difference Result 6961 states and 9072 transitions. [2022-07-21 17:19:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 17:19:05,656 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 32 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-07-21 17:19:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:19:05,664 INFO L225 Difference]: With dead ends: 6961 [2022-07-21 17:19:05,665 INFO L226 Difference]: Without dead ends: 6950 [2022-07-21 17:19:05,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=365, Invalid=3914, Unknown=11, NotChecked=0, Total=4290 [2022-07-21 17:19:05,665 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 206 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:19:05,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 2246 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 625 Invalid, 0 Unknown, 464 Unchecked, 0.3s Time] [2022-07-21 17:19:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6950 states. [2022-07-21 17:19:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6950 to 6715. [2022-07-21 17:19:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6715 states, 6335 states have (on average 1.285872138910813) internal successors, (8146), 6426 states have internal predecessors, (8146), 306 states have call successors, (306), 50 states have call predecessors, (306), 50 states have return successors, (306), 238 states have call predecessors, (306), 306 states have call successors, (306) [2022-07-21 17:19:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6715 states to 6715 states and 8758 transitions. [2022-07-21 17:19:05,731 INFO L78 Accepts]: Start accepts. Automaton has 6715 states and 8758 transitions. Word has length 56 [2022-07-21 17:19:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:19:05,732 INFO L495 AbstractCegarLoop]: Abstraction has 6715 states and 8758 transitions. [2022-07-21 17:19:05,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 32 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:19:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6715 states and 8758 transitions. [2022-07-21 17:19:05,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-21 17:19:05,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:19:05,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:19:05,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-21 17:19:05,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-07-21 17:19:05,947 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:19:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:19:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1394504025, now seen corresponding path program 1 times [2022-07-21 17:19:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:19:05,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558268212] [2022-07-21 17:19:05,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:05,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:19:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:19:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:06,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:19:06,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558268212] [2022-07-21 17:19:06,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558268212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:19:06,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973691261] [2022-07-21 17:19:06,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:19:06,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:19:06,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:19:06,130 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:19:06,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-21 17:19:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:19:06,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-21 17:19:06,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:19:06,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-21 17:19:06,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:19:06,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2022-07-21 17:19:06,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:19:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:19:06,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:19:06,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2022-07-21 17:20:01,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973691261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:01,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:20:01,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-21 17:20:01,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4932251] [2022-07-21 17:20:01,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:20:01,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-21 17:20:01,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:01,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-21 17:20:01,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=974, Unknown=25, NotChecked=0, Total=1122 [2022-07-21 17:20:01,495 INFO L87 Difference]: Start difference. First operand 6715 states and 8758 transitions. Second operand has 25 states, 24 states have (on average 4.25) internal successors, (102), 25 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:20:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:14,016 INFO L93 Difference]: Finished difference Result 7206 states and 9405 transitions. [2022-07-21 17:20:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 17:20:14,017 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.25) internal successors, (102), 25 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-07-21 17:20:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:14,024 INFO L225 Difference]: With dead ends: 7206 [2022-07-21 17:20:14,024 INFO L226 Difference]: Without dead ends: 7191 [2022-07-21 17:20:14,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 66.1s TimeCoverageRelationStatistics Valid=176, Invalid=1353, Unknown=31, NotChecked=0, Total=1560 [2022-07-21 17:20:14,025 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 283 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 620 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:14,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 2626 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 626 Invalid, 0 Unknown, 620 Unchecked, 0.3s Time] [2022-07-21 17:20:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7191 states. [2022-07-21 17:20:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7191 to 6712. [2022-07-21 17:20:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6712 states, 6332 states have (on average 1.2855337965887554) internal successors, (8140), 6423 states have internal predecessors, (8140), 306 states have call successors, (306), 50 states have call predecessors, (306), 50 states have return successors, (306), 238 states have call predecessors, (306), 306 states have call successors, (306) [2022-07-21 17:20:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6712 states to 6712 states and 8752 transitions. [2022-07-21 17:20:14,089 INFO L78 Accepts]: Start accepts. Automaton has 6712 states and 8752 transitions. Word has length 56 [2022-07-21 17:20:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:14,090 INFO L495 AbstractCegarLoop]: Abstraction has 6712 states and 8752 transitions. [2022-07-21 17:20:14,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.25) internal successors, (102), 25 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:20:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 6712 states and 8752 transitions. [2022-07-21 17:20:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 17:20:14,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:14,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:20:14,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-21 17:20:14,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-07-21 17:20:14,308 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:20:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 471291546, now seen corresponding path program 1 times [2022-07-21 17:20:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:14,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696407817] [2022-07-21 17:20:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:14,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:20:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:14,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 17:20:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:20:14,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:14,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696407817] [2022-07-21 17:20:14,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696407817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:20:14,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:20:14,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 17:20:14,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598031064] [2022-07-21 17:20:14,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:20:14,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:20:14,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:20:14,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:20:14,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:20:14,530 INFO L87 Difference]: Start difference. First operand 6712 states and 8752 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:20:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:20:15,016 INFO L93 Difference]: Finished difference Result 7803 states and 10100 transitions. [2022-07-21 17:20:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 17:20:15,017 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2022-07-21 17:20:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:20:15,024 INFO L225 Difference]: With dead ends: 7803 [2022-07-21 17:20:15,024 INFO L226 Difference]: Without dead ends: 7803 [2022-07-21 17:20:15,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2022-07-21 17:20:15,025 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 912 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:20:15,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 1146 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:20:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2022-07-21 17:20:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 6838. [2022-07-21 17:20:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6838 states, 6458 states have (on average 1.2856921647568906) internal successors, (8303), 6549 states have internal predecessors, (8303), 306 states have call successors, (306), 50 states have call predecessors, (306), 50 states have return successors, (306), 238 states have call predecessors, (306), 306 states have call successors, (306) [2022-07-21 17:20:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6838 states to 6838 states and 8915 transitions. [2022-07-21 17:20:15,092 INFO L78 Accepts]: Start accepts. Automaton has 6838 states and 8915 transitions. Word has length 57 [2022-07-21 17:20:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:20:15,093 INFO L495 AbstractCegarLoop]: Abstraction has 6838 states and 8915 transitions. [2022-07-21 17:20:15,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:20:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 6838 states and 8915 transitions. [2022-07-21 17:20:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 17:20:15,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:20:15,094 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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] [2022-07-21 17:20:15,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-07-21 17:20:15,094 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:20:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:20:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1725136247, now seen corresponding path program 1 times [2022-07-21 17:20:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:20:15,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594066396] [2022-07-21 17:20:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:15,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:20:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:15,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:20:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:15,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 17:20:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:20:15,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:20:15,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594066396] [2022-07-21 17:20:15,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594066396] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:20:15,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817110609] [2022-07-21 17:20:15,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:20:15,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:20:15,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:20:15,376 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:20:15,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-21 17:20:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:20:15,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-21 17:20:15,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:20:15,658 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:20:15,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:20:15,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:20:15,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:20:15,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:20:15,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:20:15,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:20:15,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:20:15,990 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-21 17:20:15,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-21 17:20:16,002 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-21 17:20:16,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-21 17:20:16,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:20:16,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-21 17:20:16,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:20:16,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2022-07-21 17:20:16,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:20:16,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-07-21 17:20:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:20:16,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:21:39,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1467 Int) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1461))) (let ((.cse2 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|)) (.cse1 (store (select .cse0 |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse3 (* ~unnamed1~0~LIST_BEG 4))) (or (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_append_one_~list#1.base| (store .cse1 .cse2 v_ArrVal_1467)) |c_~#list~0.base|) (+ |c_~#list~0.offset| .cse3)) 1) |c_#StackHeapBarrier|) (not (= (select .cse1 .cse2) 0)) (and (= (select .cse1 (+ |c_ULTIMATE.start_append_one_~list#1.offset| .cse3)) 0) (forall ((v_ArrVal_1466 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1466) (+ |c_ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))))))) is different from false [2022-07-21 17:21:39,230 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1467 Int) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1461))) (let ((.cse1 (* ~unnamed1~0~LIST_BEG 4)) (.cse0 (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse3 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (or (and (= (select .cse0 (+ |c_ULTIMATE.start_append_one_~list#1.offset| .cse1)) 0) (forall ((v_ArrVal_1466 Int) (v_ArrVal_1462 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1466) (+ |c_ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))) (<= (+ (select (select (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store .cse0 .cse3 v_ArrVal_1467)) |c_~#list~0.base|) (+ |c_~#list~0.offset| .cse1)) 1) |c_#StackHeapBarrier|) (not (= (select .cse0 .cse3) 0)))))) is different from false [2022-07-21 17:21:39,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817110609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:21:39,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:21:39,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 29 [2022-07-21 17:21:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952378943] [2022-07-21 17:21:39,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:21:39,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-21 17:21:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:21:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-21 17:21:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1496, Unknown=53, NotChecked=162, Total=1892 [2022-07-21 17:21:39,789 INFO L87 Difference]: Start difference. First operand 6838 states and 8915 transitions. Second operand has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 29 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:21:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:21:42,690 INFO L93 Difference]: Finished difference Result 8138 states and 10491 transitions. [2022-07-21 17:21:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-21 17:21:42,691 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 29 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2022-07-21 17:21:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:21:42,699 INFO L225 Difference]: With dead ends: 8138 [2022-07-21 17:21:42,699 INFO L226 Difference]: Without dead ends: 8138 [2022-07-21 17:21:42,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2359 ImplicationChecksByTransitivity, 84.8s TimeCoverageRelationStatistics Valid=1006, Invalid=7505, Unknown=53, NotChecked=366, Total=8930 [2022-07-21 17:21:42,700 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 1257 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 3597 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:21:42,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 3597 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1889 Invalid, 0 Unknown, 204 Unchecked, 1.0s Time] [2022-07-21 17:21:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8138 states. [2022-07-21 17:21:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8138 to 7026. [2022-07-21 17:21:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7026 states, 6631 states have (on average 1.2839692354094405) internal successors, (8514), 6725 states have internal predecessors, (8514), 316 states have call successors, (316), 55 states have call predecessors, (316), 55 states have return successors, (316), 245 states have call predecessors, (316), 316 states have call successors, (316) [2022-07-21 17:21:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7026 states to 7026 states and 9146 transitions. [2022-07-21 17:21:42,773 INFO L78 Accepts]: Start accepts. Automaton has 7026 states and 9146 transitions. Word has length 58 [2022-07-21 17:21:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:21:42,774 INFO L495 AbstractCegarLoop]: Abstraction has 7026 states and 9146 transitions. [2022-07-21 17:21:42,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 29 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:21:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 7026 states and 9146 transitions. [2022-07-21 17:21:42,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 17:21:42,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:21:42,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 1] [2022-07-21 17:21:42,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-21 17:21:42,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:21:42,991 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:21:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:21:42,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1939616316, now seen corresponding path program 1 times [2022-07-21 17:21:42,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:21:42,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711947260] [2022-07-21 17:21:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:21:42,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:21:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:21:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:21:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:21:43,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 17:21:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:21:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:21:43,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:21:43,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711947260] [2022-07-21 17:21:43,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711947260] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:21:43,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001818565] [2022-07-21 17:21:43,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:21:43,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:21:43,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:21:43,306 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:21:43,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-21 17:21:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:21:43,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-21 17:21:43,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:21:43,572 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:21:43,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:21:43,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:21:43,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:21:43,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:21:43,864 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-21 17:21:43,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-21 17:21:44,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:21:44,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-07-21 17:21:44,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:21:44,230 INFO L356 Elim1Store]: treesize reduction 44, result has 42.1 percent of original size [2022-07-21 17:21:44,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 73 [2022-07-21 17:21:45,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:21:45,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:21:45,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 55 [2022-07-21 17:21:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:21:45,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:21:45,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:21:45,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-21 17:22:00,188 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_#res#1.base|)) (.cse2 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse1 .cse2 v_ArrVal_1539)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))) (or (= .cse0 0) (= (select |c_#valid| .cse0) 1) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-07-21 17:22:00,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|)) (.cse2 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse1 .cse2 v_ArrVal_1539)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))) (or (= .cse0 0) (not (= (select .cse1 .cse2) 0)) (= (select |c_#valid| .cse0) 1))))) is different from false [2022-07-21 17:22:01,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse2 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse1 .cse2 v_ArrVal_1539)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))) (or (= (select |c_#valid| .cse0) 1) (not (= (select .cse1 .cse2) 0)) (= .cse0 0))))) is different from false [2022-07-21 17:22:01,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (v_ArrVal_1536 (Array Int Int)) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1536))) (let ((.cse0 (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse1 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store .cse0 .cse1 v_ArrVal_1539)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))) (or (not (= 0 (select .cse0 .cse1))) (= (select |c_#valid| .cse2) 1) (= .cse2 0)))))) is different from false [2022-07-21 17:22:05,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001818565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:22:05,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:22:05,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 30 [2022-07-21 17:22:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097935980] [2022-07-21 17:22:05,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:22:05,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 17:22:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:22:05,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 17:22:05,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1466, Unknown=15, NotChecked=332, Total=2070 [2022-07-21 17:22:05,581 INFO L87 Difference]: Start difference. First operand 7026 states and 9146 transitions. Second operand has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 30 states have internal predecessors, (110), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:22:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:22:06,672 INFO L93 Difference]: Finished difference Result 8793 states and 11303 transitions. [2022-07-21 17:22:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-21 17:22:06,683 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 30 states have internal predecessors, (110), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2022-07-21 17:22:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:22:06,694 INFO L225 Difference]: With dead ends: 8793 [2022-07-21 17:22:06,695 INFO L226 Difference]: Without dead ends: 8793 [2022-07-21 17:22:06,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=630, Invalid=4341, Unknown=15, NotChecked=564, Total=5550 [2022-07-21 17:22:06,697 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 452 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:22:06,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 2761 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 699 Invalid, 0 Unknown, 507 Unchecked, 0.3s Time] [2022-07-21 17:22:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2022-07-21 17:22:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 8181. [2022-07-21 17:22:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8181 states, 7723 states have (on average 1.2739867926971384) internal successors, (9839), 7829 states have internal predecessors, (9839), 372 states have call successors, (372), 62 states have call predecessors, (372), 62 states have return successors, (372), 289 states have call predecessors, (372), 372 states have call successors, (372) [2022-07-21 17:22:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8181 states to 8181 states and 10583 transitions. [2022-07-21 17:22:06,781 INFO L78 Accepts]: Start accepts. Automaton has 8181 states and 10583 transitions. Word has length 59 [2022-07-21 17:22:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:22:06,781 INFO L495 AbstractCegarLoop]: Abstraction has 8181 states and 10583 transitions. [2022-07-21 17:22:06,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 30 states have internal predecessors, (110), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:22:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 8181 states and 10583 transitions. [2022-07-21 17:22:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-21 17:22:06,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:22:06,784 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 1, 1] [2022-07-21 17:22:06,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-21 17:22:06,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:22:06,999 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-21 17:22:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:22:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1436135, now seen corresponding path program 1 times [2022-07-21 17:22:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:22:07,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007190404] [2022-07-21 17:22:07,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:22:07,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:22:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:22:07,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 17:22:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:22:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 17:22:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:22:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:22:07,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:22:07,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007190404] [2022-07-21 17:22:07,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007190404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:22:07,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684559691] [2022-07-21 17:22:07,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:22:07,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:22:07,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:22:07,368 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:22:07,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-21 17:22:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:22:07,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-21 17:22:07,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:22:07,619 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:22:07,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 17:22:07,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:22:07,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:22:07,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 17:22:07,822 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-21 17:22:07,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-21 17:22:07,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:22:07,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-07-21 17:22:08,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:22:08,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-21 17:22:08,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:22:08,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2022-07-21 17:22:08,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 17:22:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:22:08,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:22:08,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:22:08,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-21 17:22:08,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:22:08,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2022-07-21 17:22:20,625 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_append_one_~to#1| Int)) (or (and (= |c_~#list~0.base| |c_ULTIMATE.start_append_one_~list#1.base|) (forall ((v_ArrVal_1613 Int)) (not (= |c_~#list~0.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_#res#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1613)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))))) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_#res#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|)) 0)))) is different from false [2022-07-21 17:22:22,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_append_one_~to#1| Int)) (or (and (forall ((v_ArrVal_1613 Int)) (not (= |c_~#list~0.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1613)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))))) (= |c_~#list~0.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|)) 0)))) is different from false [2022-07-21 17:22:34,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1609 (Array Int Int)) (|ULTIMATE.start_append_one_~to#1| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1609) |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|)) 0)) (and (forall ((v_ArrVal_1613 Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1609))) (store .cse0 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse0 |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1613))) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))) |c_~#list~0.base|))) (= |c_~#list~0.base| |c_ULTIMATE.start_append_one_~list#1.base|)))) is different from false [2022-07-21 17:22:34,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_25| Int) (v_ArrVal_1609 (Array Int Int)) (|ULTIMATE.start_append_one_~to#1| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_25| v_ArrVal_1609) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* 4 |ULTIMATE.start_append_one_~to#1|)) |v_ULTIMATE.start_create_item_~item~0#1.base_25|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_END 4))) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_25|) 0)) (forall ((v_ArrVal_1613 Int)) (not (= |c_~#list~0.base| (select (store (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_25| v_ArrVal_1609) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* 4 |ULTIMATE.start_append_one_~to#1|)) |v_ULTIMATE.start_create_item_~item~0#1.base_25|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_END 4)) v_ArrVal_1613) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))))))) is different from false [2022-07-21 17:22:34,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684559691] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:22:34,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:22:34,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 33 [2022-07-21 17:22:34,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181250531] [2022-07-21 17:22:34,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:22:34,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 17:22:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:22:34,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 17:22:34,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1595, Unknown=15, NotChecked=340, Total=2162 [2022-07-21 17:22:34,935 INFO L87 Difference]: Start difference. First operand 8181 states and 10583 transitions. Second operand has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 33 states have internal predecessors, (112), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)