./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0217.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0217.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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:34:27,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:34:27,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:34:27,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:34:27,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:34:27,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:34:27,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:34:27,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:34:27,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:34:27,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:34:27,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:34:27,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:34:27,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:34:27,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:34:27,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:34:27,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:34:27,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:34:27,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:34:27,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:34:27,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:34:27,518 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:34:27,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:34:27,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:34:27,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:34:27,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:34:27,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:34:27,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:34:27,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:34:27,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:34:27,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:34:27,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:34:27,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:34:27,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:34:27,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:34:27,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:34:27,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:34:27,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:34:27,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:34:27,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:34:27,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:34:27,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:34:27,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:34:27,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:34:27,556 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:34:27,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:34:27,559 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:34:27,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:34:27,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:34:27,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:34:27,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:34:27,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:34:27,560 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:34:27,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:34:27,561 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:34:27,561 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:34:27,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:34:27,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:34:27,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:34:27,562 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:34:27,562 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:34:27,562 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:34:27,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:34:27,563 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:34:27,563 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:34:27,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:34:27,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:34:27,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:34:27,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:34:27,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:34:27,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:34:27,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:34:27,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:34:27,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:34:27,565 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 -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2022-07-12 18:34:27,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:34:27,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:34:27,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:34:27,784 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:34:27,785 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:34:27,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0217.i [2022-07-12 18:34:27,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4cc2616/f154a993b4c747169105e0eace324d0f/FLAG0c671c4e0 [2022-07-12 18:34:28,288 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:34:28,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2022-07-12 18:34:28,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4cc2616/f154a993b4c747169105e0eace324d0f/FLAG0c671c4e0 [2022-07-12 18:34:28,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4cc2616/f154a993b4c747169105e0eace324d0f [2022-07-12 18:34:28,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:34:28,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:34:28,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:34:28,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:34:28,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:34:28,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b64b3cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28, skipping insertion in model container [2022-07-12 18:34:28,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:34:28,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:34:28,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:34:28,667 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:34:28,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:34:28,744 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:34:28,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28 WrapperNode [2022-07-12 18:34:28,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:34:28,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:34:28,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:34:28,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:34:28,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,793 INFO L137 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 218 [2022-07-12 18:34:28,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:34:28,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:34:28,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:34:28,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:34:28,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:34:28,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:34:28,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:34:28,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:34:28,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (1/1) ... [2022-07-12 18:34:28,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:34:28,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:34:28,855 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-12 18:34:28,865 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-12 18:34:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-07-12 18:34:28,884 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-07-12 18:34:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:34:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:34:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:34:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:34:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:34:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:34:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 18:34:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:34:28,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:34:28,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:34:28,996 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:34:28,997 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:34:29,384 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:34:29,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:34:29,391 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 18:34:29,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:34:29 BoogieIcfgContainer [2022-07-12 18:34:29,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:34:29,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:34:29,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:34:29,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:34:29,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:34:28" (1/3) ... [2022-07-12 18:34:29,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156be915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:34:29, skipping insertion in model container [2022-07-12 18:34:29,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:34:28" (2/3) ... [2022-07-12 18:34:29,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156be915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:34:29, skipping insertion in model container [2022-07-12 18:34:29,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:34:29" (3/3) ... [2022-07-12 18:34:29,400 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0217.i [2022-07-12 18:34:29,409 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:34:29,409 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-07-12 18:34:29,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:34:29,450 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@68c99ec1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66f3e8ef [2022-07-12 18:34:29,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-07-12 18:34:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 100 states have (on average 1.94) internal successors, (194), 167 states have internal predecessors, (194), 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-12 18:34:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:34:29,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:29,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:34:29,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:29,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1074949738, now seen corresponding path program 1 times [2022-07-12 18:34:29,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:29,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698211654] [2022-07-12 18:34:29,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:29,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:29,568 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-12 18:34:29,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:29,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698211654] [2022-07-12 18:34:29,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698211654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:29,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:29,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:34:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969674389] [2022-07-12 18:34:29,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:29,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 18:34:29,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:29,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 18:34:29,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:34:29,597 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 1.94) internal successors, (194), 167 states have internal predecessors, (194), 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-12 18:34:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:29,625 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2022-07-12 18:34:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 18:34:29,627 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-12 18:34:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:29,637 INFO L225 Difference]: With dead ends: 171 [2022-07-12 18:34:29,637 INFO L226 Difference]: Without dead ends: 169 [2022-07-12 18:34:29,638 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-12 18:34:29,641 INFO L413 NwaCegarLoop]: 192 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, 192 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-12 18:34:29,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:34:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-12 18:34:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-12 18:34:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 99 states have (on average 1.878787878787879) internal successors, (186), 165 states have internal predecessors, (186), 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-12 18:34:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2022-07-12 18:34:29,689 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 6 [2022-07-12 18:34:29,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:29,689 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2022-07-12 18:34:29,689 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-12 18:34:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2022-07-12 18:34:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:34:29,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:29,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:29,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:34:29,691 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:29,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:29,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1280317330, now seen corresponding path program 1 times [2022-07-12 18:34:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:29,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711634680] [2022-07-12 18:34:29,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:29,794 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-12 18:34:29,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:29,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711634680] [2022-07-12 18:34:29,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711634680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:29,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:29,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-12 18:34:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848605588] [2022-07-12 18:34:29,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:29,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:34:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:29,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:34:29,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:34:29,797 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12 18:34:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:29,980 INFO L93 Difference]: Finished difference Result 329 states and 370 transitions. [2022-07-12 18:34:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:34:29,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-07-12 18:34:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:29,985 INFO L225 Difference]: With dead ends: 329 [2022-07-12 18:34:29,985 INFO L226 Difference]: Without dead ends: 329 [2022-07-12 18:34:29,988 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-12 18:34:29,989 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 171 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:29,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 249 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-12 18:34:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 233. [2022-07-12 18:34:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 160 states have (on average 1.8625) internal successors, (298), 226 states have internal predecessors, (298), 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-12 18:34:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2022-07-12 18:34:30,009 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 7 [2022-07-12 18:34:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:30,009 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2022-07-12 18:34:30,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12 18:34:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2022-07-12 18:34:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:34:30,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:30,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:30,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:34:30,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:30,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1280317329, now seen corresponding path program 1 times [2022-07-12 18:34:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:30,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895282708] [2022-07-12 18:34:30,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:30,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:30,092 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-12 18:34:30,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:30,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895282708] [2022-07-12 18:34:30,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895282708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:30,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:30,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:34:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751157677] [2022-07-12 18:34:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:30,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:30,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:30,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:30,095 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12 18:34:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:30,234 INFO L93 Difference]: Finished difference Result 376 states and 474 transitions. [2022-07-12 18:34:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:34:30,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-07-12 18:34:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:30,236 INFO L225 Difference]: With dead ends: 376 [2022-07-12 18:34:30,236 INFO L226 Difference]: Without dead ends: 376 [2022-07-12 18:34:30,236 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-12 18:34:30,237 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 141 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:30,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 422 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-12 18:34:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 310. [2022-07-12 18:34:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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-12 18:34:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2022-07-12 18:34:30,251 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 7 [2022-07-12 18:34:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:30,251 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2022-07-12 18:34:30,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12 18:34:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2022-07-12 18:34:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:34:30,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:30,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:30,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:34:30,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:30,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1280317267, now seen corresponding path program 1 times [2022-07-12 18:34:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:30,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211897478] [2022-07-12 18:34:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:30,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-12 18:34:30,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:30,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211897478] [2022-07-12 18:34:30,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211897478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:30,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:30,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:34:30,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857664458] [2022-07-12 18:34:30,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:30,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:30,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:30,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:30,329 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12 18:34:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:30,481 INFO L93 Difference]: Finished difference Result 375 states and 472 transitions. [2022-07-12 18:34:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:34:30,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-07-12 18:34:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:30,483 INFO L225 Difference]: With dead ends: 375 [2022-07-12 18:34:30,483 INFO L226 Difference]: Without dead ends: 375 [2022-07-12 18:34:30,483 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-12 18:34:30,484 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 123 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:30,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 436 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-07-12 18:34:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 310. [2022-07-12 18:34:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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-12 18:34:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2022-07-12 18:34:30,500 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 7 [2022-07-12 18:34:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:30,501 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2022-07-12 18:34:30,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12 18:34:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2022-07-12 18:34:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:34:30,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:30,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:30,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:34:30,503 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1671227278, now seen corresponding path program 1 times [2022-07-12 18:34:30,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:30,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297763668] [2022-07-12 18:34:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:30,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:30,610 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-12 18:34:30,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:30,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297763668] [2022-07-12 18:34:30,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297763668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:30,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:30,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024796751] [2022-07-12 18:34:30,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:30,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:30,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:30,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:30,612 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 18:34:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:30,795 INFO L93 Difference]: Finished difference Result 461 states and 621 transitions. [2022-07-12 18:34:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:34:30,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-07-12 18:34:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:30,798 INFO L225 Difference]: With dead ends: 461 [2022-07-12 18:34:30,798 INFO L226 Difference]: Without dead ends: 461 [2022-07-12 18:34:30,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:34:30,799 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:30,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 803 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-07-12 18:34:30,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 352. [2022-07-12 18:34:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 270 states have (on average 1.8074074074074074) internal successors, (488), 339 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:34:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 508 transitions. [2022-07-12 18:34:30,810 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 508 transitions. Word has length 10 [2022-07-12 18:34:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:30,812 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 508 transitions. [2022-07-12 18:34:30,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 18:34:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 508 transitions. [2022-07-12 18:34:30,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:34:30,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:30,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:30,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:34:30,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1673074320, now seen corresponding path program 1 times [2022-07-12 18:34:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:30,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879173061] [2022-07-12 18:34:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:30,887 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-12 18:34:30,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:30,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879173061] [2022-07-12 18:34:30,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879173061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:30,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:30,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971208390] [2022-07-12 18:34:30,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:30,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:30,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:30,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:30,889 INFO L87 Difference]: Start difference. First operand 352 states and 508 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 18:34:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:31,016 INFO L93 Difference]: Finished difference Result 451 states and 610 transitions. [2022-07-12 18:34:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:34:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-07-12 18:34:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:31,018 INFO L225 Difference]: With dead ends: 451 [2022-07-12 18:34:31,018 INFO L226 Difference]: Without dead ends: 451 [2022-07-12 18:34:31,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:34:31,018 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 131 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:31,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 762 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-12 18:34:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 351. [2022-07-12 18:34:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 269 states have (on average 1.8104089219330854) internal successors, (487), 338 states have internal predecessors, (487), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:34:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 507 transitions. [2022-07-12 18:34:31,025 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 507 transitions. Word has length 10 [2022-07-12 18:34:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:31,025 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 507 transitions. [2022-07-12 18:34:31,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 18:34:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 507 transitions. [2022-07-12 18:34:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:34:31,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:31,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:31,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:34:31,026 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:31,026 INFO L85 PathProgramCache]: Analyzing trace with hash 268436822, now seen corresponding path program 1 times [2022-07-12 18:34:31,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:31,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835885820] [2022-07-12 18:34:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:31,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:31,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-12 18:34:31,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:31,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835885820] [2022-07-12 18:34:31,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835885820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:31,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:31,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:34:31,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852092665] [2022-07-12 18:34:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:31,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:34:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:31,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:34:31,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:34:31,043 INFO L87 Difference]: Start difference. First operand 351 states and 507 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:34:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:31,114 INFO L93 Difference]: Finished difference Result 406 states and 560 transitions. [2022-07-12 18:34:31,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:34:31,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:34:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:31,116 INFO L225 Difference]: With dead ends: 406 [2022-07-12 18:34:31,116 INFO L226 Difference]: Without dead ends: 399 [2022-07-12 18:34:31,116 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-12 18:34:31,118 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 70 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:31,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 287 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-07-12 18:34:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 348. [2022-07-12 18:34:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 266 states have (on average 1.8120300751879699) internal successors, (482), 335 states have internal predecessors, (482), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:34:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 502 transitions. [2022-07-12 18:34:31,126 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 502 transitions. Word has length 11 [2022-07-12 18:34:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:31,126 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 502 transitions. [2022-07-12 18:34:31,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:34:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 502 transitions. [2022-07-12 18:34:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:34:31,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:31,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:31,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:34:31,128 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:31,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:31,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1044692257, now seen corresponding path program 1 times [2022-07-12 18:34:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:31,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105739279] [2022-07-12 18:34:31,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:31,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:31,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-12 18:34:31,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:31,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105739279] [2022-07-12 18:34:31,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105739279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:31,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:31,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:34:31,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190363626] [2022-07-12 18:34:31,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:31,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:31,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:31,174 INFO L87 Difference]: Start difference. First operand 348 states and 502 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:34:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:31,357 INFO L93 Difference]: Finished difference Result 570 states and 734 transitions. [2022-07-12 18:34:31,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:34:31,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-07-12 18:34:31,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:31,360 INFO L225 Difference]: With dead ends: 570 [2022-07-12 18:34:31,360 INFO L226 Difference]: Without dead ends: 570 [2022-07-12 18:34:31,360 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-12 18:34:31,361 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 329 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:31,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 434 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:34:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-07-12 18:34:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 354. [2022-07-12 18:34:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 272 states have (on average 1.7941176470588236) internal successors, (488), 341 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:34:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 508 transitions. [2022-07-12 18:34:31,370 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 508 transitions. Word has length 15 [2022-07-12 18:34:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:31,370 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 508 transitions. [2022-07-12 18:34:31,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:34:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 508 transitions. [2022-07-12 18:34:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:34:31,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:31,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:31,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:34:31,372 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:31,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1044692256, now seen corresponding path program 1 times [2022-07-12 18:34:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:31,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058981881] [2022-07-12 18:34:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:31,422 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-12 18:34:31,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:31,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058981881] [2022-07-12 18:34:31,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058981881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:31,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:31,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:34:31,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508610679] [2022-07-12 18:34:31,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:31,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:31,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:31,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:31,424 INFO L87 Difference]: Start difference. First operand 354 states and 508 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:34:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:31,566 INFO L93 Difference]: Finished difference Result 408 states and 530 transitions. [2022-07-12 18:34:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:34:31,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-07-12 18:34:31,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:31,568 INFO L225 Difference]: With dead ends: 408 [2022-07-12 18:34:31,568 INFO L226 Difference]: Without dead ends: 408 [2022-07-12 18:34:31,568 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-12 18:34:31,569 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 197 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:31,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 445 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-12 18:34:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 354. [2022-07-12 18:34:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 272 states have (on average 1.7610294117647058) internal successors, (479), 341 states have internal predecessors, (479), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:34:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 499 transitions. [2022-07-12 18:34:31,577 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 499 transitions. Word has length 15 [2022-07-12 18:34:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:31,577 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 499 transitions. [2022-07-12 18:34:31,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:34:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 499 transitions. [2022-07-12 18:34:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:34:31,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:31,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:31,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:34:31,578 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash 742849514, now seen corresponding path program 1 times [2022-07-12 18:34:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:31,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504054357] [2022-07-12 18:34:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:31,654 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-12 18:34:31,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:31,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504054357] [2022-07-12 18:34:31,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504054357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:31,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:31,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:34:31,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235343457] [2022-07-12 18:34:31,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:31,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:34:31,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:34:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:34:31,658 INFO L87 Difference]: Start difference. First operand 354 states and 499 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-12 18:34:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:31,914 INFO L93 Difference]: Finished difference Result 707 states and 854 transitions. [2022-07-12 18:34:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:34:31,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-12 18:34:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:31,917 INFO L225 Difference]: With dead ends: 707 [2022-07-12 18:34:31,917 INFO L226 Difference]: Without dead ends: 707 [2022-07-12 18:34:31,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:34:31,918 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 867 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:31,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 521 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:34:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-07-12 18:34:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 351. [2022-07-12 18:34:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 273 states have (on average 1.7326007326007327) internal successors, (473), 338 states have internal predecessors, (473), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:34:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 493 transitions. [2022-07-12 18:34:31,926 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 493 transitions. Word has length 17 [2022-07-12 18:34:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:31,926 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 493 transitions. [2022-07-12 18:34:31,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-12 18:34:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 493 transitions. [2022-07-12 18:34:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:34:31,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:31,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:31,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:34:31,927 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:31,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash 742849515, now seen corresponding path program 1 times [2022-07-12 18:34:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:31,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351616287] [2022-07-12 18:34:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:32,019 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-12 18:34:32,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:32,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351616287] [2022-07-12 18:34:32,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351616287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:32,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:32,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:34:32,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329362373] [2022-07-12 18:34:32,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:32,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:34:32,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:32,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:34:32,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:34:32,021 INFO L87 Difference]: Start difference. First operand 351 states and 493 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-12 18:34:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:32,537 INFO L93 Difference]: Finished difference Result 766 states and 951 transitions. [2022-07-12 18:34:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:34:32,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-12 18:34:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:32,540 INFO L225 Difference]: With dead ends: 766 [2022-07-12 18:34:32,540 INFO L226 Difference]: Without dead ends: 766 [2022-07-12 18:34:32,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:34:32,541 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 895 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:32,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 697 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:34:32,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-07-12 18:34:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 384. [2022-07-12 18:34:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 304 states have (on average 1.7203947368421053) internal successors, (523), 370 states have internal predecessors, (523), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-12 18:34:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 547 transitions. [2022-07-12 18:34:32,550 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 547 transitions. Word has length 17 [2022-07-12 18:34:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:32,550 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 547 transitions. [2022-07-12 18:34:32,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-12 18:34:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 547 transitions. [2022-07-12 18:34:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:34:32,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:32,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:32,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:34:32,552 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:32,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1064604948, now seen corresponding path program 1 times [2022-07-12 18:34:32,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:32,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772048861] [2022-07-12 18:34:32,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:32,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:32,596 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-12 18:34:32,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:32,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772048861] [2022-07-12 18:34:32,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772048861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:32,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:32,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:34:32,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673006272] [2022-07-12 18:34:32,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:32,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:32,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:32,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:32,598 INFO L87 Difference]: Start difference. First operand 384 states and 547 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-12 18:34:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:32,641 INFO L93 Difference]: Finished difference Result 614 states and 849 transitions. [2022-07-12 18:34:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:34:32,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-12 18:34:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:32,644 INFO L225 Difference]: With dead ends: 614 [2022-07-12 18:34:32,644 INFO L226 Difference]: Without dead ends: 614 [2022-07-12 18:34:32,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:34:32,645 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 243 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:32,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1545 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:34:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-07-12 18:34:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 394. [2022-07-12 18:34:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 311 states have (on average 1.7009646302250805) internal successors, (529), 379 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 559 transitions. [2022-07-12 18:34:32,655 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 559 transitions. Word has length 17 [2022-07-12 18:34:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:32,656 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 559 transitions. [2022-07-12 18:34:32,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-12 18:34:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 559 transitions. [2022-07-12 18:34:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:34:32,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:32,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:32,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:34:32,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1357040557, now seen corresponding path program 1 times [2022-07-12 18:34:32,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:32,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229795944] [2022-07-12 18:34:32,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:32,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:32,749 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-12 18:34:32,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:32,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229795944] [2022-07-12 18:34:32,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229795944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:32,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:32,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:32,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468155483] [2022-07-12 18:34:32,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:32,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:32,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:32,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:32,751 INFO L87 Difference]: Start difference. First operand 394 states and 559 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-12 18:34:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:33,274 INFO L93 Difference]: Finished difference Result 793 states and 993 transitions. [2022-07-12 18:34:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:34:33,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18 [2022-07-12 18:34:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:33,278 INFO L225 Difference]: With dead ends: 793 [2022-07-12 18:34:33,278 INFO L226 Difference]: Without dead ends: 793 [2022-07-12 18:34:33,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:34:33,279 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 545 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:33,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 835 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:34:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-07-12 18:34:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 391. [2022-07-12 18:34:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 308 states have (on average 1.7012987012987013) internal successors, (524), 376 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 554 transitions. [2022-07-12 18:34:33,290 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 554 transitions. Word has length 18 [2022-07-12 18:34:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:33,290 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 554 transitions. [2022-07-12 18:34:33,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-12 18:34:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 554 transitions. [2022-07-12 18:34:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:34:33,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:33,292 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-12 18:34:33,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:34:33,292 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1279047357, now seen corresponding path program 1 times [2022-07-12 18:34:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:33,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125104323] [2022-07-12 18:34:33,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:33,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:33,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:33,515 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-12 18:34:33,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:33,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125104323] [2022-07-12 18:34:33,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125104323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:33,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:33,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:34:33,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008078024] [2022-07-12 18:34:33,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:33,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:34:33,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:33,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:34:33,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:34:33,517 INFO L87 Difference]: Start difference. First operand 391 states and 554 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-12 18:34:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:33,972 INFO L93 Difference]: Finished difference Result 813 states and 1121 transitions. [2022-07-12 18:34:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:34:33,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-12 18:34:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:33,976 INFO L225 Difference]: With dead ends: 813 [2022-07-12 18:34:33,976 INFO L226 Difference]: Without dead ends: 811 [2022-07-12 18:34:33,976 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-12 18:34:33,977 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 568 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:33,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1860 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:34:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-07-12 18:34:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 385. [2022-07-12 18:34:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 302 states have (on average 1.6986754966887416) internal successors, (513), 370 states have internal predecessors, (513), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 543 transitions. [2022-07-12 18:34:33,985 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 543 transitions. Word has length 21 [2022-07-12 18:34:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:33,986 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 543 transitions. [2022-07-12 18:34:33,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-12 18:34:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 543 transitions. [2022-07-12 18:34:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:34:33,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:33,987 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-12 18:34:33,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:34:33,991 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:33,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2000662896, now seen corresponding path program 1 times [2022-07-12 18:34:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:33,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983843562] [2022-07-12 18:34:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:34,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:34,124 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-12 18:34:34,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:34,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983843562] [2022-07-12 18:34:34,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983843562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:34,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:34,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:34:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394510686] [2022-07-12 18:34:34,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:34,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:34:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:34,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:34:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:34:34,126 INFO L87 Difference]: Start difference. First operand 385 states and 543 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-12 18:34:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:34,406 INFO L93 Difference]: Finished difference Result 548 states and 728 transitions. [2022-07-12 18:34:34,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:34:34,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-12 18:34:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:34,409 INFO L225 Difference]: With dead ends: 548 [2022-07-12 18:34:34,409 INFO L226 Difference]: Without dead ends: 548 [2022-07-12 18:34:34,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:34:34,409 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 200 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:34,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1103 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:34:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-12 18:34:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 401. [2022-07-12 18:34:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 318 states have (on average 1.6761006289308176) internal successors, (533), 384 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 563 transitions. [2022-07-12 18:34:34,416 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 563 transitions. Word has length 21 [2022-07-12 18:34:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:34,416 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 563 transitions. [2022-07-12 18:34:34,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-12 18:34:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 563 transitions. [2022-07-12 18:34:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:34:34,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:34,417 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] [2022-07-12 18:34:34,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:34:34,417 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:34,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1680606867, now seen corresponding path program 1 times [2022-07-12 18:34:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:34,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171340125] [2022-07-12 18:34:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:34,468 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-12 18:34:34,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:34,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171340125] [2022-07-12 18:34:34,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171340125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:34,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:34,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:34:34,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897523047] [2022-07-12 18:34:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:34,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:34,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:34,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:34,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:34,471 INFO L87 Difference]: Start difference. First operand 401 states and 563 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-12 18:34:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:34,502 INFO L93 Difference]: Finished difference Result 646 states and 894 transitions. [2022-07-12 18:34:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:34:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2022-07-12 18:34:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:34,504 INFO L225 Difference]: With dead ends: 646 [2022-07-12 18:34:34,504 INFO L226 Difference]: Without dead ends: 646 [2022-07-12 18:34:34,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:34:34,505 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 245 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:34,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1235 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:34:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-07-12 18:34:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 403. [2022-07-12 18:34:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 320 states have (on average 1.671875) internal successors, (535), 386 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 565 transitions. [2022-07-12 18:34:34,511 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 565 transitions. Word has length 22 [2022-07-12 18:34:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:34,512 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 565 transitions. [2022-07-12 18:34:34,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-12 18:34:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 565 transitions. [2022-07-12 18:34:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:34:34,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:34,512 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] [2022-07-12 18:34:34,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:34:34,513 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:34,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:34,513 INFO L85 PathProgramCache]: Analyzing trace with hash -839353067, now seen corresponding path program 1 times [2022-07-12 18:34:34,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:34,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331155077] [2022-07-12 18:34:34,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:34,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:34,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:34,547 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-12 18:34:34,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:34,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331155077] [2022-07-12 18:34:34,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331155077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:34,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:34,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:34:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352663075] [2022-07-12 18:34:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:34,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:34,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:34,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:34,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:34,548 INFO L87 Difference]: Start difference. First operand 403 states and 565 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-12 18:34:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:34,581 INFO L93 Difference]: Finished difference Result 642 states and 886 transitions. [2022-07-12 18:34:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:34:34,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2022-07-12 18:34:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:34,583 INFO L225 Difference]: With dead ends: 642 [2022-07-12 18:34:34,583 INFO L226 Difference]: Without dead ends: 642 [2022-07-12 18:34:34,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:34:34,584 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 242 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:34,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1251 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:34:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-07-12 18:34:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 401. [2022-07-12 18:34:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 318 states have (on average 1.6635220125786163) internal successors, (529), 384 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 559 transitions. [2022-07-12 18:34:34,593 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 559 transitions. Word has length 22 [2022-07-12 18:34:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:34,593 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 559 transitions. [2022-07-12 18:34:34,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-12 18:34:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 559 transitions. [2022-07-12 18:34:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:34:34,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:34,595 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] [2022-07-12 18:34:34,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:34:34,595 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1175048242, now seen corresponding path program 1 times [2022-07-12 18:34:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:34,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815091553] [2022-07-12 18:34:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:34,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:34,682 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-12 18:34:34,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:34,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815091553] [2022-07-12 18:34:34,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815091553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:34,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:34,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:34:34,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526005994] [2022-07-12 18:34:34,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:34,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:34:34,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:34,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:34:34,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:34:34,684 INFO L87 Difference]: Start difference. First operand 401 states and 559 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-12 18:34:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:34,910 INFO L93 Difference]: Finished difference Result 578 states and 779 transitions. [2022-07-12 18:34:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:34:34,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2022-07-12 18:34:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:34,912 INFO L225 Difference]: With dead ends: 578 [2022-07-12 18:34:34,912 INFO L226 Difference]: Without dead ends: 578 [2022-07-12 18:34:34,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:34:34,913 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 194 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:34,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1197 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:34,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-07-12 18:34:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2022-07-12 18:34:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 328 states have (on average 1.649390243902439) internal successors, (541), 392 states have internal predecessors, (541), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 571 transitions. [2022-07-12 18:34:34,919 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 571 transitions. Word has length 22 [2022-07-12 18:34:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:34,920 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 571 transitions. [2022-07-12 18:34:34,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-12 18:34:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 571 transitions. [2022-07-12 18:34:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:34:34,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:34,920 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-12 18:34:34,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 18:34:34,921 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:34,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash -796222002, now seen corresponding path program 1 times [2022-07-12 18:34:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:34,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650058249] [2022-07-12 18:34:34,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:34,945 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-12 18:34:34,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:34,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650058249] [2022-07-12 18:34:34,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650058249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:34,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:34,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:34:34,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559574650] [2022-07-12 18:34:34,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:34,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:34,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:34,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:34,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:34,946 INFO L87 Difference]: Start difference. First operand 411 states and 571 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-12 18:34:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:35,103 INFO L93 Difference]: Finished difference Result 654 states and 844 transitions. [2022-07-12 18:34:35,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:34:35,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-12 18:34:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:35,105 INFO L225 Difference]: With dead ends: 654 [2022-07-12 18:34:35,105 INFO L226 Difference]: Without dead ends: 654 [2022-07-12 18:34:35,106 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-12 18:34:35,106 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 303 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:35,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 442 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-07-12 18:34:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 439. [2022-07-12 18:34:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 356 states have (on average 1.6657303370786516) internal successors, (593), 420 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 623 transitions. [2022-07-12 18:34:35,113 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 623 transitions. Word has length 23 [2022-07-12 18:34:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:35,113 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 623 transitions. [2022-07-12 18:34:35,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-12 18:34:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 623 transitions. [2022-07-12 18:34:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:34:35,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:35,114 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-12 18:34:35,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 18:34:35,114 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:35,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash -796222001, now seen corresponding path program 1 times [2022-07-12 18:34:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:35,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238221364] [2022-07-12 18:34:35,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,191 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-12 18:34:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:35,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238221364] [2022-07-12 18:34:35,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238221364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:35,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:35,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152363064] [2022-07-12 18:34:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:35,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:35,192 INFO L87 Difference]: Start difference. First operand 439 states and 623 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-12 18:34:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:35,407 INFO L93 Difference]: Finished difference Result 491 states and 648 transitions. [2022-07-12 18:34:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:34:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-12 18:34:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:35,408 INFO L225 Difference]: With dead ends: 491 [2022-07-12 18:34:35,409 INFO L226 Difference]: Without dead ends: 491 [2022-07-12 18:34:35,409 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-12 18:34:35,409 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 366 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:35,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 543 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:34:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-12 18:34:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 439. [2022-07-12 18:34:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 356 states have (on average 1.6404494382022472) internal successors, (584), 420 states have internal predecessors, (584), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 614 transitions. [2022-07-12 18:34:35,416 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 614 transitions. Word has length 23 [2022-07-12 18:34:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:35,416 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 614 transitions. [2022-07-12 18:34:35,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-12 18:34:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 614 transitions. [2022-07-12 18:34:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:34:35,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:35,417 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-12 18:34:35,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 18:34:35,417 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:35,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1911985061, now seen corresponding path program 1 times [2022-07-12 18:34:35,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:35,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677000919] [2022-07-12 18:34:35,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:35,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,433 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-12 18:34:35,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:35,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677000919] [2022-07-12 18:34:35,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677000919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:35,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:35,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:34:35,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062382267] [2022-07-12 18:34:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:35,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:35,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:35,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:35,434 INFO L87 Difference]: Start difference. First operand 439 states and 614 transitions. Second operand has 4 states, 4 states have (on average 5.75) 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-12 18:34:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:35,447 INFO L93 Difference]: Finished difference Result 451 states and 626 transitions. [2022-07-12 18:34:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:34:35,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) 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-12 18:34:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:35,449 INFO L225 Difference]: With dead ends: 451 [2022-07-12 18:34:35,449 INFO L226 Difference]: Without dead ends: 451 [2022-07-12 18:34:35,449 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-12 18:34:35,450 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 3 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:35,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 541 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:34:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-12 18:34:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 448. [2022-07-12 18:34:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 365 states have (on average 1.6246575342465754) internal successors, (593), 429 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 623 transitions. [2022-07-12 18:34:35,456 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 623 transitions. Word has length 25 [2022-07-12 18:34:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:35,456 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 623 transitions. [2022-07-12 18:34:35,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) 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-12 18:34:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 623 transitions. [2022-07-12 18:34:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:34:35,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:35,457 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-12 18:34:35,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 18:34:35,457 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:35,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:35,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1913832103, now seen corresponding path program 1 times [2022-07-12 18:34:35,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:35,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442298474] [2022-07-12 18:34:35,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:35,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,492 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-12 18:34:35,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:35,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442298474] [2022-07-12 18:34:35,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442298474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:35,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:35,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:34:35,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128033717] [2022-07-12 18:34:35,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:35,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:35,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:35,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:35,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:35,493 INFO L87 Difference]: Start difference. First operand 448 states and 623 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-12 18:34:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:35,623 INFO L93 Difference]: Finished difference Result 756 states and 1001 transitions. [2022-07-12 18:34:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:34:35,624 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-12 18:34:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:35,626 INFO L225 Difference]: With dead ends: 756 [2022-07-12 18:34:35,626 INFO L226 Difference]: Without dead ends: 756 [2022-07-12 18:34:35,626 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-12 18:34:35,627 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 427 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:35,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 455 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-07-12 18:34:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 507. [2022-07-12 18:34:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 425 states have (on average 1.6) internal successors, (680), 488 states have internal predecessors, (680), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 710 transitions. [2022-07-12 18:34:35,634 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 710 transitions. Word has length 25 [2022-07-12 18:34:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:35,634 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 710 transitions. [2022-07-12 18:34:35,634 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-12 18:34:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 710 transitions. [2022-07-12 18:34:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:34:35,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:35,635 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-12 18:34:35,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 18:34:35,635 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:35,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:35,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1913832102, now seen corresponding path program 1 times [2022-07-12 18:34:35,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:35,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209611506] [2022-07-12 18:34:35,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:35,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,654 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-12 18:34:35,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:35,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209611506] [2022-07-12 18:34:35,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209611506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:35,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:35,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:34:35,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379023194] [2022-07-12 18:34:35,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:35,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:34:35,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:35,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:34:35,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:34:35,656 INFO L87 Difference]: Start difference. First operand 507 states and 710 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-12 18:34:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:35,730 INFO L93 Difference]: Finished difference Result 594 states and 801 transitions. [2022-07-12 18:34:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:34:35,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-12 18:34:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:35,732 INFO L225 Difference]: With dead ends: 594 [2022-07-12 18:34:35,732 INFO L226 Difference]: Without dead ends: 594 [2022-07-12 18:34:35,732 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-12 18:34:35,733 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:35,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 272 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-12 18:34:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 504. [2022-07-12 18:34:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 698 transitions. [2022-07-12 18:34:35,741 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 698 transitions. Word has length 25 [2022-07-12 18:34:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:35,741 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 698 transitions. [2022-07-12 18:34:35,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-12 18:34:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 698 transitions. [2022-07-12 18:34:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:34:35,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:35,742 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] [2022-07-12 18:34:35,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 18:34:35,742 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:35,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2102112361, now seen corresponding path program 1 times [2022-07-12 18:34:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:35,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31285748] [2022-07-12 18:34:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,777 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-12 18:34:35,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:35,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31285748] [2022-07-12 18:34:35,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31285748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:35,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:35,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:34:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729611005] [2022-07-12 18:34:35,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:35,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:35,779 INFO L87 Difference]: Start difference. First operand 504 states and 698 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-12 18:34:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:35,916 INFO L93 Difference]: Finished difference Result 810 states and 1070 transitions. [2022-07-12 18:34:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:34:35,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 26 [2022-07-12 18:34:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:35,918 INFO L225 Difference]: With dead ends: 810 [2022-07-12 18:34:35,918 INFO L226 Difference]: Without dead ends: 810 [2022-07-12 18:34:35,918 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-12 18:34:35,919 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 326 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:35,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 515 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-07-12 18:34:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 504. [2022-07-12 18:34:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 698 transitions. [2022-07-12 18:34:35,926 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 698 transitions. Word has length 26 [2022-07-12 18:34:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:35,926 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 698 transitions. [2022-07-12 18:34:35,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-12 18:34:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 698 transitions. [2022-07-12 18:34:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:34:35,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:35,927 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] [2022-07-12 18:34:35,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 18:34:35,927 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1491790357, now seen corresponding path program 1 times [2022-07-12 18:34:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:35,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117936512] [2022-07-12 18:34:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:35,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:35,985 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-12 18:34:35,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:35,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117936512] [2022-07-12 18:34:35,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117936512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:35,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:35,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:34:35,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729273501] [2022-07-12 18:34:35,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:35,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:35,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:35,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:35,987 INFO L87 Difference]: Start difference. First operand 504 states and 698 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 18:34:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:36,020 INFO L93 Difference]: Finished difference Result 708 states and 959 transitions. [2022-07-12 18:34:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:34:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2022-07-12 18:34:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:36,022 INFO L225 Difference]: With dead ends: 708 [2022-07-12 18:34:36,022 INFO L226 Difference]: Without dead ends: 708 [2022-07-12 18:34:36,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:34:36,023 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 233 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:36,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1487 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:34:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-07-12 18:34:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 443. [2022-07-12 18:34:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 424 states have internal predecessors, (574), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2022-07-12 18:34:36,030 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 26 [2022-07-12 18:34:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:36,030 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2022-07-12 18:34:36,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 18:34:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2022-07-12 18:34:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:34:36,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:36,031 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-12 18:34:36,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 18:34:36,031 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:36,031 INFO L85 PathProgramCache]: Analyzing trace with hash 731575509, now seen corresponding path program 1 times [2022-07-12 18:34:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:36,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434389421] [2022-07-12 18:34:36,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:36,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,080 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-12 18:34:36,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:36,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434389421] [2022-07-12 18:34:36,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434389421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:36,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:36,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:34:36,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687567559] [2022-07-12 18:34:36,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:36,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:34:36,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:36,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:34:36,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:34:36,082 INFO L87 Difference]: Start difference. First operand 443 states and 604 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-12 18:34:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:36,185 INFO L93 Difference]: Finished difference Result 517 states and 672 transitions. [2022-07-12 18:34:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:34:36,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-12 18:34:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:36,187 INFO L225 Difference]: With dead ends: 517 [2022-07-12 18:34:36,187 INFO L226 Difference]: Without dead ends: 517 [2022-07-12 18:34:36,187 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-12 18:34:36,188 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 167 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:36,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 660 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-12 18:34:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 443. [2022-07-12 18:34:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 365 states have (on average 1.5698630136986302) internal successors, (573), 424 states have internal predecessors, (573), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 603 transitions. [2022-07-12 18:34:36,193 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 603 transitions. Word has length 27 [2022-07-12 18:34:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:36,194 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 603 transitions. [2022-07-12 18:34:36,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-12 18:34:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 603 transitions. [2022-07-12 18:34:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:34:36,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:36,194 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-12 18:34:36,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 18:34:36,195 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:36,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 946649543, now seen corresponding path program 1 times [2022-07-12 18:34:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:36,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774908490] [2022-07-12 18:34:36,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,241 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-12 18:34:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:36,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774908490] [2022-07-12 18:34:36,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774908490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:36,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:36,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:34:36,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875280653] [2022-07-12 18:34:36,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:36,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:34:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:36,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:34:36,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:34:36,243 INFO L87 Difference]: Start difference. First operand 443 states and 603 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) 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-12 18:34:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:36,373 INFO L93 Difference]: Finished difference Result 645 states and 864 transitions. [2022-07-12 18:34:36,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:34:36,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) 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-12 18:34:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:36,375 INFO L225 Difference]: With dead ends: 645 [2022-07-12 18:34:36,375 INFO L226 Difference]: Without dead ends: 645 [2022-07-12 18:34:36,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:34:36,376 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 158 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:36,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1294 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-07-12 18:34:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 473. [2022-07-12 18:34:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 395 states have (on average 1.539240506329114) internal successors, (608), 454 states have internal predecessors, (608), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 638 transitions. [2022-07-12 18:34:36,381 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 638 transitions. Word has length 27 [2022-07-12 18:34:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:36,382 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 638 transitions. [2022-07-12 18:34:36,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) 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-12 18:34:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 638 transitions. [2022-07-12 18:34:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:34:36,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:36,382 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-12 18:34:36,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 18:34:36,382 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:36,382 INFO L85 PathProgramCache]: Analyzing trace with hash 946649737, now seen corresponding path program 1 times [2022-07-12 18:34:36,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:36,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517344296] [2022-07-12 18:34:36,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:36,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,412 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-12 18:34:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:36,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517344296] [2022-07-12 18:34:36,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517344296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:36,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:36,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:34:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966959606] [2022-07-12 18:34:36,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:36,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:36,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:36,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:36,414 INFO L87 Difference]: Start difference. First operand 473 states and 638 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-12 18:34:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:36,523 INFO L93 Difference]: Finished difference Result 808 states and 1039 transitions. [2022-07-12 18:34:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:34:36,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-12 18:34:36,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:36,529 INFO L225 Difference]: With dead ends: 808 [2022-07-12 18:34:36,529 INFO L226 Difference]: Without dead ends: 808 [2022-07-12 18:34:36,529 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-12 18:34:36,530 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 482 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:36,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 405 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-07-12 18:34:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 563. [2022-07-12 18:34:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 485 states have (on average 1.5175257731958762) internal successors, (736), 544 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 766 transitions. [2022-07-12 18:34:36,539 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 766 transitions. Word has length 27 [2022-07-12 18:34:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:36,539 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 766 transitions. [2022-07-12 18:34:36,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-12 18:34:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 766 transitions. [2022-07-12 18:34:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:34:36,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:36,540 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-12 18:34:36,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 18:34:36,540 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:36,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1204004541, now seen corresponding path program 1 times [2022-07-12 18:34:36,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:36,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136808770] [2022-07-12 18:34:36,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:36,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,601 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-12 18:34:36,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:36,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136808770] [2022-07-12 18:34:36,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136808770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:36,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:36,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:34:36,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905234696] [2022-07-12 18:34:36,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:36,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:34:36,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:36,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:34:36,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:34:36,603 INFO L87 Difference]: Start difference. First operand 563 states and 766 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-12 18:34:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:36,762 INFO L93 Difference]: Finished difference Result 758 states and 993 transitions. [2022-07-12 18:34:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:34:36,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-12 18:34:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:36,764 INFO L225 Difference]: With dead ends: 758 [2022-07-12 18:34:36,764 INFO L226 Difference]: Without dead ends: 758 [2022-07-12 18:34:36,765 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-12 18:34:36,765 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 218 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:36,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 665 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-07-12 18:34:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 601. [2022-07-12 18:34:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 519 states have (on average 1.5144508670520231) internal successors, (786), 580 states have internal predecessors, (786), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-12 18:34:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 822 transitions. [2022-07-12 18:34:36,772 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 822 transitions. Word has length 28 [2022-07-12 18:34:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:36,773 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 822 transitions. [2022-07-12 18:34:36,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-12 18:34:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 822 transitions. [2022-07-12 18:34:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:34:36,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:36,773 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-12 18:34:36,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 18:34:36,774 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1495351243, now seen corresponding path program 1 times [2022-07-12 18:34:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:36,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786381078] [2022-07-12 18:34:36,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,803 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-12 18:34:36,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:36,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786381078] [2022-07-12 18:34:36,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786381078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:36,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:36,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:34:36,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645361739] [2022-07-12 18:34:36,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:36,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:36,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:36,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:36,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:36,805 INFO L87 Difference]: Start difference. First operand 601 states and 822 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-12 18:34:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:36,931 INFO L93 Difference]: Finished difference Result 845 states and 1089 transitions. [2022-07-12 18:34:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:34:36,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-12 18:34:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:36,935 INFO L225 Difference]: With dead ends: 845 [2022-07-12 18:34:36,935 INFO L226 Difference]: Without dead ends: 845 [2022-07-12 18:34:36,935 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-12 18:34:36,936 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 317 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:36,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 518 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-07-12 18:34:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 510. [2022-07-12 18:34:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 429 states have (on average 1.5198135198135199) internal successors, (652), 489 states have internal predecessors, (652), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-12 18:34:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 688 transitions. [2022-07-12 18:34:36,943 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 688 transitions. Word has length 28 [2022-07-12 18:34:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:36,943 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 688 transitions. [2022-07-12 18:34:36,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-12 18:34:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 688 transitions. [2022-07-12 18:34:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:34:36,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:36,944 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-12 18:34:36,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 18:34:36,944 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:36,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:36,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1910467130, now seen corresponding path program 1 times [2022-07-12 18:34:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:36,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182883733] [2022-07-12 18:34:36,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:36,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:37,000 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-12 18:34:37,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:37,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182883733] [2022-07-12 18:34:37,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182883733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:37,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:37,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:34:37,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080745397] [2022-07-12 18:34:37,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:37,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:34:37,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:37,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:34:37,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:34:37,002 INFO L87 Difference]: Start difference. First operand 510 states and 688 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-12 18:34:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:37,237 INFO L93 Difference]: Finished difference Result 1252 states and 1682 transitions. [2022-07-12 18:34:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:34:37,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-12 18:34:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:37,241 INFO L225 Difference]: With dead ends: 1252 [2022-07-12 18:34:37,241 INFO L226 Difference]: Without dead ends: 1252 [2022-07-12 18:34:37,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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-12 18:34:37,241 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 540 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:37,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1622 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:34:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-07-12 18:34:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 644. [2022-07-12 18:34:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 563 states have (on average 1.5204262877442274) internal successors, (856), 617 states have internal predecessors, (856), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-12 18:34:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 892 transitions. [2022-07-12 18:34:37,251 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 892 transitions. Word has length 30 [2022-07-12 18:34:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:37,251 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 892 transitions. [2022-07-12 18:34:37,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-12 18:34:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 892 transitions. [2022-07-12 18:34:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:34:37,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:37,251 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-12 18:34:37,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 18:34:37,252 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:37,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:37,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1702169087, now seen corresponding path program 1 times [2022-07-12 18:34:37,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:37,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189273419] [2022-07-12 18:34:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:37,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:37,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:37,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-12 18:34:37,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:37,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189273419] [2022-07-12 18:34:37,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189273419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:37,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:37,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:37,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685941020] [2022-07-12 18:34:37,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:37,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:37,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:37,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:37,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:37,330 INFO L87 Difference]: Start difference. First operand 644 states and 892 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-12 18:34:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:37,722 INFO L93 Difference]: Finished difference Result 1137 states and 1525 transitions. [2022-07-12 18:34:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:34:37,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-12 18:34:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:37,726 INFO L225 Difference]: With dead ends: 1137 [2022-07-12 18:34:37,726 INFO L226 Difference]: Without dead ends: 1137 [2022-07-12 18:34:37,726 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-12 18:34:37,726 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 470 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:37,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1053 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:34:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-07-12 18:34:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 687. [2022-07-12 18:34:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 602 states have (on average 1.5016611295681064) internal successors, (904), 657 states have internal predecessors, (904), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 946 transitions. [2022-07-12 18:34:37,736 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 946 transitions. Word has length 30 [2022-07-12 18:34:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:37,737 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 946 transitions. [2022-07-12 18:34:37,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-12 18:34:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 946 transitions. [2022-07-12 18:34:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:34:37,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:37,737 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-12 18:34:37,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 18:34:37,738 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:37,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:37,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1975675941, now seen corresponding path program 1 times [2022-07-12 18:34:37,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:37,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166878875] [2022-07-12 18:34:37,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:37,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:37,779 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-12 18:34:37,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:37,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166878875] [2022-07-12 18:34:37,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166878875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:37,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:37,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106023011] [2022-07-12 18:34:37,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:37,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:34:37,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:34:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:34:37,781 INFO L87 Difference]: Start difference. First operand 687 states and 946 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-12 18:34:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:37,807 INFO L93 Difference]: Finished difference Result 1055 states and 1417 transitions. [2022-07-12 18:34:37,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:34:37,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-12 18:34:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:37,810 INFO L225 Difference]: With dead ends: 1055 [2022-07-12 18:34:37,811 INFO L226 Difference]: Without dead ends: 1055 [2022-07-12 18:34:37,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-12 18:34:37,811 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 226 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:37,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1130 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:34:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-07-12 18:34:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 679. [2022-07-12 18:34:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 594 states have (on average 1.5016835016835017) internal successors, (892), 649 states have internal predecessors, (892), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 934 transitions. [2022-07-12 18:34:37,821 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 934 transitions. Word has length 30 [2022-07-12 18:34:37,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:37,821 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 934 transitions. [2022-07-12 18:34:37,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-12 18:34:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 934 transitions. [2022-07-12 18:34:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:34:37,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:37,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, 1, 1] [2022-07-12 18:34:37,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 18:34:37,823 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:37,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:37,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1977522983, now seen corresponding path program 1 times [2022-07-12 18:34:37,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:37,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108427515] [2022-07-12 18:34:37,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:37,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:37,888 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-12 18:34:37,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:37,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108427515] [2022-07-12 18:34:37,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108427515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:37,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:37,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:34:37,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061949483] [2022-07-12 18:34:37,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:37,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:34:37,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:37,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:34:37,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:34:37,891 INFO L87 Difference]: Start difference. First operand 679 states and 934 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-12 18:34:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:38,106 INFO L93 Difference]: Finished difference Result 1259 states and 1668 transitions. [2022-07-12 18:34:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:34:38,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-12 18:34:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:38,109 INFO L225 Difference]: With dead ends: 1259 [2022-07-12 18:34:38,109 INFO L226 Difference]: Without dead ends: 1259 [2022-07-12 18:34:38,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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-12 18:34:38,109 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 502 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:38,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1798 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:34:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-07-12 18:34:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 646. [2022-07-12 18:34:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 564 states have (on average 1.4663120567375887) internal successors, (827), 616 states have internal predecessors, (827), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 869 transitions. [2022-07-12 18:34:38,119 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 869 transitions. Word has length 30 [2022-07-12 18:34:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:38,119 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 869 transitions. [2022-07-12 18:34:38,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-12 18:34:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 869 transitions. [2022-07-12 18:34:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:34:38,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:38,120 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] [2022-07-12 18:34:38,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-12 18:34:38,121 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1227634393, now seen corresponding path program 1 times [2022-07-12 18:34:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972274091] [2022-07-12 18:34:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:38,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:38,199 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-12 18:34:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:38,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972274091] [2022-07-12 18:34:38,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972274091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:38,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:38,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:34:38,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58087381] [2022-07-12 18:34:38,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:38,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:34:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:38,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:34:38,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:34:38,201 INFO L87 Difference]: Start difference. First operand 646 states and 869 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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-12 18:34:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:38,502 INFO L93 Difference]: Finished difference Result 925 states and 1194 transitions. [2022-07-12 18:34:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:34:38,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 31 [2022-07-12 18:34:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:38,509 INFO L225 Difference]: With dead ends: 925 [2022-07-12 18:34:38,510 INFO L226 Difference]: Without dead ends: 925 [2022-07-12 18:34:38,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:34:38,510 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 573 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:38,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 759 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:34:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-07-12 18:34:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 646. [2022-07-12 18:34:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 564 states have (on average 1.4592198581560283) internal successors, (823), 616 states have internal predecessors, (823), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 865 transitions. [2022-07-12 18:34:38,518 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 865 transitions. Word has length 31 [2022-07-12 18:34:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:38,518 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 865 transitions. [2022-07-12 18:34:38,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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-12 18:34:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 865 transitions. [2022-07-12 18:34:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:34:38,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:38,519 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-12 18:34:38,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-12 18:34:38,519 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:38,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:38,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2007870586, now seen corresponding path program 1 times [2022-07-12 18:34:38,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:38,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949165112] [2022-07-12 18:34:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:38,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:38,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:38,660 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-12 18:34:38,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:38,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949165112] [2022-07-12 18:34:38,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949165112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:38,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:38,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:34:38,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468232234] [2022-07-12 18:34:38,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:38,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:38,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:38,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:38,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:38,663 INFO L87 Difference]: Start difference. First operand 646 states and 865 transitions. Second operand has 6 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-12 18:34:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:38,826 INFO L93 Difference]: Finished difference Result 695 states and 913 transitions. [2022-07-12 18:34:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:34:38,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 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-12 18:34:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:38,828 INFO L225 Difference]: With dead ends: 695 [2022-07-12 18:34:38,828 INFO L226 Difference]: Without dead ends: 695 [2022-07-12 18:34:38,828 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-12 18:34:38,829 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 110 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:38,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 835 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:38,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-07-12 18:34:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 625. [2022-07-12 18:34:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 543 states have (on average 1.4659300184162063) internal successors, (796), 597 states have internal predecessors, (796), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 838 transitions. [2022-07-12 18:34:38,840 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 838 transitions. Word has length 32 [2022-07-12 18:34:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:38,841 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 838 transitions. [2022-07-12 18:34:38,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-12 18:34:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 838 transitions. [2022-07-12 18:34:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:34:38,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:38,841 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, 1] [2022-07-12 18:34:38,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-12 18:34:38,842 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:38,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1362637237, now seen corresponding path program 1 times [2022-07-12 18:34:38,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:38,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105180458] [2022-07-12 18:34:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:38,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:38,874 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-12 18:34:38,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:38,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105180458] [2022-07-12 18:34:38,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105180458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:38,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:38,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:38,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185440114] [2022-07-12 18:34:38,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:38,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:38,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:38,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:38,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:38,877 INFO L87 Difference]: Start difference. First operand 625 states and 838 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-12 18:34:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:39,023 INFO L93 Difference]: Finished difference Result 729 states and 966 transitions. [2022-07-12 18:34:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:34:39,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2022-07-12 18:34:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:39,025 INFO L225 Difference]: With dead ends: 729 [2022-07-12 18:34:39,026 INFO L226 Difference]: Without dead ends: 729 [2022-07-12 18:34:39,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:34:39,026 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 468 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:39,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 565 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-07-12 18:34:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 624. [2022-07-12 18:34:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 543 states have (on average 1.4622467771639043) internal successors, (794), 596 states have internal predecessors, (794), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 836 transitions. [2022-07-12 18:34:39,046 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 836 transitions. Word has length 35 [2022-07-12 18:34:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:39,046 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 836 transitions. [2022-07-12 18:34:39,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-12 18:34:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 836 transitions. [2022-07-12 18:34:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:34:39,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:39,049 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, 1] [2022-07-12 18:34:39,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-12 18:34:39,049 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:39,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1362637238, now seen corresponding path program 1 times [2022-07-12 18:34:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:39,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487645646] [2022-07-12 18:34:39,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:39,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:39,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:39,147 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-12 18:34:39,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:39,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487645646] [2022-07-12 18:34:39,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487645646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:39,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:39,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:39,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741830845] [2022-07-12 18:34:39,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:39,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:39,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:39,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:39,150 INFO L87 Difference]: Start difference. First operand 624 states and 836 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-12 18:34:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:39,302 INFO L93 Difference]: Finished difference Result 661 states and 851 transitions. [2022-07-12 18:34:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:34:39,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2022-07-12 18:34:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:39,305 INFO L225 Difference]: With dead ends: 661 [2022-07-12 18:34:39,305 INFO L226 Difference]: Without dead ends: 661 [2022-07-12 18:34:39,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:34:39,305 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 496 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:39,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 618 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-12 18:34:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 623. [2022-07-12 18:34:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 543 states have (on average 1.4585635359116023) internal successors, (792), 595 states have internal predecessors, (792), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 834 transitions. [2022-07-12 18:34:39,319 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 834 transitions. Word has length 35 [2022-07-12 18:34:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:39,320 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 834 transitions. [2022-07-12 18:34:39,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-12 18:34:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 834 transitions. [2022-07-12 18:34:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 18:34:39,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:39,320 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, 1, 1, 1] [2022-07-12 18:34:39,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-12 18:34:39,321 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash -470637162, now seen corresponding path program 1 times [2022-07-12 18:34:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:39,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709072131] [2022-07-12 18:34:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:39,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:39,357 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-12 18:34:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:39,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709072131] [2022-07-12 18:34:39,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709072131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:39,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:39,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:34:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850373095] [2022-07-12 18:34:39,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:39,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:34:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:39,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:34:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:34:39,359 INFO L87 Difference]: Start difference. First operand 623 states and 834 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-12 18:34:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:39,509 INFO L93 Difference]: Finished difference Result 1070 states and 1398 transitions. [2022-07-12 18:34:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:34:39,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 37 [2022-07-12 18:34:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:39,512 INFO L225 Difference]: With dead ends: 1070 [2022-07-12 18:34:39,512 INFO L226 Difference]: Without dead ends: 1070 [2022-07-12 18:34:39,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:34:39,513 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 619 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:39,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 513 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2022-07-12 18:34:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 620. [2022-07-12 18:34:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 543 states have (on average 1.4475138121546962) internal successors, (786), 592 states have internal predecessors, (786), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 828 transitions. [2022-07-12 18:34:39,521 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 828 transitions. Word has length 37 [2022-07-12 18:34:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:39,521 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 828 transitions. [2022-07-12 18:34:39,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-12 18:34:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 828 transitions. [2022-07-12 18:34:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 18:34:39,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:39,522 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, 1, 1, 1] [2022-07-12 18:34:39,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-12 18:34:39,522 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash -470637161, now seen corresponding path program 1 times [2022-07-12 18:34:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:39,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601788097] [2022-07-12 18:34:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:39,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:39,598 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-12 18:34:39,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:39,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601788097] [2022-07-12 18:34:39,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601788097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:39,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:39,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:39,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59564389] [2022-07-12 18:34:39,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:39,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:39,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:39,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:39,600 INFO L87 Difference]: Start difference. First operand 620 states and 828 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-12 18:34:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:39,765 INFO L93 Difference]: Finished difference Result 896 states and 1151 transitions. [2022-07-12 18:34:39,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:34:39,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 37 [2022-07-12 18:34:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:39,767 INFO L225 Difference]: With dead ends: 896 [2022-07-12 18:34:39,767 INFO L226 Difference]: Without dead ends: 896 [2022-07-12 18:34:39,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:34:39,768 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 770 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:39,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 609 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-12 18:34:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 619. [2022-07-12 18:34:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 543 states have (on average 1.4438305709023942) internal successors, (784), 591 states have internal predecessors, (784), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 826 transitions. [2022-07-12 18:34:39,784 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 826 transitions. Word has length 37 [2022-07-12 18:34:39,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:39,785 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 826 transitions. [2022-07-12 18:34:39,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-12 18:34:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 826 transitions. [2022-07-12 18:34:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 18:34:39,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:39,785 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, 1, 1, 1] [2022-07-12 18:34:39,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-12 18:34:39,786 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash -470637000, now seen corresponding path program 1 times [2022-07-12 18:34:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:39,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184388176] [2022-07-12 18:34:39,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:39,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:39,852 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-12 18:34:39,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:39,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184388176] [2022-07-12 18:34:39,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184388176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:39,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:39,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:34:39,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232021443] [2022-07-12 18:34:39,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:39,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:34:39,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:39,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:34:39,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:34:39,855 INFO L87 Difference]: Start difference. First operand 619 states and 826 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-12 18:34:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:40,114 INFO L93 Difference]: Finished difference Result 787 states and 995 transitions. [2022-07-12 18:34:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:34:40,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 37 [2022-07-12 18:34:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:40,120 INFO L225 Difference]: With dead ends: 787 [2022-07-12 18:34:40,120 INFO L226 Difference]: Without dead ends: 787 [2022-07-12 18:34:40,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:40,121 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 375 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:40,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 551 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:34:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-07-12 18:34:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 619. [2022-07-12 18:34:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 543 states have (on average 1.4401473296500922) internal successors, (782), 591 states have internal predecessors, (782), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 824 transitions. [2022-07-12 18:34:40,139 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 824 transitions. Word has length 37 [2022-07-12 18:34:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:40,140 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 824 transitions. [2022-07-12 18:34:40,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-12 18:34:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 824 transitions. [2022-07-12 18:34:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 18:34:40,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:40,141 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] [2022-07-12 18:34:40,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-12 18:34:40,141 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:40,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1641938402, now seen corresponding path program 1 times [2022-07-12 18:34:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:40,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40973791] [2022-07-12 18:34:40,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:40,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:40,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 18:34:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:34:40,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:40,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40973791] [2022-07-12 18:34:40,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40973791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:40,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459239390] [2022-07-12 18:34:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:40,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:40,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:34:40,206 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-12 18:34:40,222 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-12 18:34:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:40,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:34:40,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:34:40,589 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-12 18:34:40,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:34:40,632 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:34:40,633 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-12 18:34:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:34:40,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459239390] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:34:40,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:34:40,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-12 18:34:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766872566] [2022-07-12 18:34:40,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:34:40,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:34:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:40,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:34:40,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:34:40,664 INFO L87 Difference]: Start difference. First operand 619 states and 824 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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-12 18:34:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:41,276 INFO L93 Difference]: Finished difference Result 1838 states and 2259 transitions. [2022-07-12 18:34:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:34:41,279 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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 43 [2022-07-12 18:34:41,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:41,282 INFO L225 Difference]: With dead ends: 1838 [2022-07-12 18:34:41,282 INFO L226 Difference]: Without dead ends: 1838 [2022-07-12 18:34:41,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 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-12 18:34:41,287 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 3347 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3349 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:41,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3349 Valid, 1186 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:34:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-07-12 18:34:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 735. [2022-07-12 18:34:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 653 states have (on average 1.3705972434915774) internal successors, (895), 696 states have internal predecessors, (895), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 28 states have call predecessors, (40), 20 states have call successors, (40) [2022-07-12 18:34:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 955 transitions. [2022-07-12 18:34:41,311 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 955 transitions. Word has length 43 [2022-07-12 18:34:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:41,311 INFO L495 AbstractCegarLoop]: Abstraction has 735 states and 955 transitions. [2022-07-12 18:34:41,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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-12 18:34:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 955 transitions. [2022-07-12 18:34:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:34:41,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:41,318 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:41,345 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-12 18:34:41,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:41,543 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:41,543 INFO L85 PathProgramCache]: Analyzing trace with hash -974885366, now seen corresponding path program 1 times [2022-07-12 18:34:41,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:41,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086548017] [2022-07-12 18:34:41,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:41,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:41,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086548017] [2022-07-12 18:34:41,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086548017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:41,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:41,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:34:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117982281] [2022-07-12 18:34:41,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:41,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:34:41,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:41,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:34:41,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:34:41,586 INFO L87 Difference]: Start difference. First operand 735 states and 955 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-12 18:34:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:41,599 INFO L93 Difference]: Finished difference Result 868 states and 1111 transitions. [2022-07-12 18:34:41,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:34:41,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-12 18:34:41,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:41,601 INFO L225 Difference]: With dead ends: 868 [2022-07-12 18:34:41,601 INFO L226 Difference]: Without dead ends: 868 [2022-07-12 18:34:41,602 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-12 18:34:41,606 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 152 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 582 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-12 18:34:41,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 582 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:34:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-07-12 18:34:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 691. [2022-07-12 18:34:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 613 states have (on average 1.3800978792822185) internal successors, (846), 656 states have internal predecessors, (846), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 25 states have call predecessors, (36), 18 states have call successors, (36) [2022-07-12 18:34:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 900 transitions. [2022-07-12 18:34:41,617 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 900 transitions. Word has length 45 [2022-07-12 18:34:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:41,618 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 900 transitions. [2022-07-12 18:34:41,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-12 18:34:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 900 transitions. [2022-07-12 18:34:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:34:41,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:41,619 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:41,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-12 18:34:41,619 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1845991888, now seen corresponding path program 1 times [2022-07-12 18:34:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:41,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554627468] [2022-07-12 18:34:41,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:41,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:41,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:41,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:41,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554627468] [2022-07-12 18:34:41,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554627468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:41,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776875596] [2022-07-12 18:34:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:41,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:41,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:34:41,709 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-12 18:34:41,715 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-12 18:34:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:41,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 18:34:41,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:34:41,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:34:41,879 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-12 18:34:41,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:34:41,882 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-12 18:34:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:34:41,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:34:41,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776875596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:41,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:34:41,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2022-07-12 18:34:41,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109981873] [2022-07-12 18:34:41,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:41,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:34:41,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:41,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:34:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:34:41,914 INFO L87 Difference]: Start difference. First operand 691 states and 900 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 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-12 18:34:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:42,201 INFO L93 Difference]: Finished difference Result 605 states and 758 transitions. [2022-07-12 18:34:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:34:42,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 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-12 18:34:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:42,203 INFO L225 Difference]: With dead ends: 605 [2022-07-12 18:34:42,203 INFO L226 Difference]: Without dead ends: 605 [2022-07-12 18:34:42,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:34:42,204 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 286 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:42,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1441 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-07-12 18:34:42,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 438. [2022-07-12 18:34:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 380 states have (on average 1.4052631578947368) internal successors, (534), 418 states have internal predecessors, (534), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-12 18:34:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 558 transitions. [2022-07-12 18:34:42,209 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 558 transitions. Word has length 45 [2022-07-12 18:34:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:42,210 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 558 transitions. [2022-07-12 18:34:42,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 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-12 18:34:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 558 transitions. [2022-07-12 18:34:42,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 18:34:42,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:42,211 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:42,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:34:42,426 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,SelfDestructingSolverStorable43 [2022-07-12 18:34:42,427 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:42,427 INFO L85 PathProgramCache]: Analyzing trace with hash -102248492, now seen corresponding path program 1 times [2022-07-12 18:34:42,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:42,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865536801] [2022-07-12 18:34:42,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:42,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:42,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:42,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865536801] [2022-07-12 18:34:42,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865536801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:42,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:42,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:34:42,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160114974] [2022-07-12 18:34:42,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:42,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:34:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:42,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:34:42,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:34:42,568 INFO L87 Difference]: Start difference. First operand 438 states and 558 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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-12 18:34:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:42,983 INFO L93 Difference]: Finished difference Result 836 states and 1072 transitions. [2022-07-12 18:34:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:34:42,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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-12 18:34:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:42,985 INFO L225 Difference]: With dead ends: 836 [2022-07-12 18:34:42,985 INFO L226 Difference]: Without dead ends: 836 [2022-07-12 18:34:42,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:34:42,986 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 752 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:42,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 853 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:34:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-07-12 18:34:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 439. [2022-07-12 18:34:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 382 states have (on average 1.4005235602094241) internal successors, (535), 419 states have internal predecessors, (535), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-12 18:34:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 559 transitions. [2022-07-12 18:34:42,992 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 559 transitions. Word has length 48 [2022-07-12 18:34:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:42,992 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 559 transitions. [2022-07-12 18:34:42,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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-12 18:34:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 559 transitions. [2022-07-12 18:34:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 18:34:42,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:42,993 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:42,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-12 18:34:42,993 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash -102248430, now seen corresponding path program 1 times [2022-07-12 18:34:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:42,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713805158] [2022-07-12 18:34:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:43,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:43,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:43,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713805158] [2022-07-12 18:34:43,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713805158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:43,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:43,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:43,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319947564] [2022-07-12 18:34:43,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:43,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:43,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:43,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:43,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:43,071 INFO L87 Difference]: Start difference. First operand 439 states and 559 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 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-12 18:34:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:43,202 INFO L93 Difference]: Finished difference Result 454 states and 572 transitions. [2022-07-12 18:34:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:34:43,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 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-12 18:34:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:43,203 INFO L225 Difference]: With dead ends: 454 [2022-07-12 18:34:43,203 INFO L226 Difference]: Without dead ends: 454 [2022-07-12 18:34:43,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:34:43,204 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 393 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:43,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 318 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-07-12 18:34:43,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 436. [2022-07-12 18:34:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 380 states have (on average 1.394736842105263) internal successors, (530), 416 states have internal predecessors, (530), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-12 18:34:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 554 transitions. [2022-07-12 18:34:43,209 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 554 transitions. Word has length 48 [2022-07-12 18:34:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:43,210 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 554 transitions. [2022-07-12 18:34:43,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 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-12 18:34:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 554 transitions. [2022-07-12 18:34:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 18:34:43,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:43,211 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-12 18:34:43,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-12 18:34:43,211 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1483644560, now seen corresponding path program 1 times [2022-07-12 18:34:43,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:43,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837574895] [2022-07-12 18:34:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:43,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:43,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 18:34:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:34:43,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:43,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837574895] [2022-07-12 18:34:43,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837574895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:43,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:43,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:34:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749458838] [2022-07-12 18:34:43,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:43,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:34:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:34:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:34:43,280 INFO L87 Difference]: Start difference. First operand 436 states and 554 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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-12 18:34:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:43,423 INFO L93 Difference]: Finished difference Result 503 states and 640 transitions. [2022-07-12 18:34:43,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:34:43,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 50 [2022-07-12 18:34:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:43,425 INFO L225 Difference]: With dead ends: 503 [2022-07-12 18:34:43,425 INFO L226 Difference]: Without dead ends: 503 [2022-07-12 18:34:43,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:34:43,426 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 465 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:43,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 316 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:34:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-07-12 18:34:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 434. [2022-07-12 18:34:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 380 states have (on average 1.3631578947368421) internal successors, (518), 414 states have internal predecessors, (518), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-12 18:34:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 542 transitions. [2022-07-12 18:34:43,432 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 542 transitions. Word has length 50 [2022-07-12 18:34:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:43,432 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 542 transitions. [2022-07-12 18:34:43,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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-12 18:34:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 542 transitions. [2022-07-12 18:34:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 18:34:43,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:43,433 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 18:34:43,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-12 18:34:43,433 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash -952792567, now seen corresponding path program 1 times [2022-07-12 18:34:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:43,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205026218] [2022-07-12 18:34:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:43,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:43,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205026218] [2022-07-12 18:34:43,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205026218] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:43,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319404541] [2022-07-12 18:34:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:43,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:43,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:34:43,666 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-12 18:34:43,668 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-12 18:34:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:43,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 18:34:43,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:34:43,858 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-12 18:34:44,132 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 18 treesize of output 14 [2022-07-12 18:34:44,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:34:44,435 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 28 treesize of output 9 [2022-07-12 18:34:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:44,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:34:44,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319404541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:44,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:34:44,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2022-07-12 18:34:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411687285] [2022-07-12 18:34:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:44,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:34:44,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:34:44,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-07-12 18:34:44,444 INFO L87 Difference]: Start difference. First operand 434 states and 542 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-12 18:34:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:44,717 INFO L93 Difference]: Finished difference Result 583 states and 711 transitions. [2022-07-12 18:34:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:34:44,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-12 18:34:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:44,718 INFO L225 Difference]: With dead ends: 583 [2022-07-12 18:34:44,718 INFO L226 Difference]: Without dead ends: 583 [2022-07-12 18:34:44,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2022-07-12 18:34:44,719 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 283 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:44,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1003 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 175 Unchecked, 0.2s Time] [2022-07-12 18:34:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-07-12 18:34:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 504. [2022-07-12 18:34:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 447 states have (on average 1.3512304250559284) internal successors, (604), 482 states have internal predecessors, (604), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 16 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 18:34:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 634 transitions. [2022-07-12 18:34:44,725 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 634 transitions. Word has length 51 [2022-07-12 18:34:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:44,725 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 634 transitions. [2022-07-12 18:34:44,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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-12 18:34:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 634 transitions. [2022-07-12 18:34:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 18:34:44,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:44,726 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 18:34:44,767 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-12 18:34:44,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:44,950 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:44,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash -952792566, now seen corresponding path program 1 times [2022-07-12 18:34:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:44,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710528433] [2022-07-12 18:34:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:45,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:45,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:45,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710528433] [2022-07-12 18:34:45,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710528433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:45,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:45,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:34:45,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918587222] [2022-07-12 18:34:45,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:45,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:34:45,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:45,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:34:45,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:34:45,201 INFO L87 Difference]: Start difference. First operand 504 states and 634 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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-12 18:34:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:46,148 INFO L93 Difference]: Finished difference Result 1561 states and 1967 transitions. [2022-07-12 18:34:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:34:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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-12 18:34:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:46,151 INFO L225 Difference]: With dead ends: 1561 [2022-07-12 18:34:46,151 INFO L226 Difference]: Without dead ends: 1561 [2022-07-12 18:34:46,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-07-12 18:34:46,152 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 979 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:46,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1626 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:34:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2022-07-12 18:34:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 752. [2022-07-12 18:34:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 683 states have (on average 1.357247437774524) internal successors, (927), 721 states have internal predecessors, (927), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 22 states have call predecessors, (32), 16 states have call successors, (32) [2022-07-12 18:34:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 975 transitions. [2022-07-12 18:34:46,182 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 975 transitions. Word has length 51 [2022-07-12 18:34:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:46,182 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 975 transitions. [2022-07-12 18:34:46,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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-12 18:34:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 975 transitions. [2022-07-12 18:34:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 18:34:46,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:46,183 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 18:34:46,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-12 18:34:46,184 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash -950945525, now seen corresponding path program 1 times [2022-07-12 18:34:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:46,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54100691] [2022-07-12 18:34:46,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:46,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:46,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:46,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54100691] [2022-07-12 18:34:46,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54100691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:46,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:46,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:34:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337479186] [2022-07-12 18:34:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:46,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:34:46,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:46,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:34:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:34:46,696 INFO L87 Difference]: Start difference. First operand 752 states and 975 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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-12 18:34:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:47,177 INFO L93 Difference]: Finished difference Result 859 states and 1098 transitions. [2022-07-12 18:34:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:34:47,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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-12 18:34:47,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:47,179 INFO L225 Difference]: With dead ends: 859 [2022-07-12 18:34:47,179 INFO L226 Difference]: Without dead ends: 859 [2022-07-12 18:34:47,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:34:47,179 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 243 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:47,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1015 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:34:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-07-12 18:34:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 707. [2022-07-12 18:34:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 642 states have (on average 1.35202492211838) internal successors, (868), 678 states have internal predecessors, (868), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 910 transitions. [2022-07-12 18:34:47,188 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 910 transitions. Word has length 51 [2022-07-12 18:34:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:47,188 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 910 transitions. [2022-07-12 18:34:47,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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-12 18:34:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 910 transitions. [2022-07-12 18:34:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 18:34:47,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:47,189 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:47,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-12 18:34:47,190 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:47,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash 764231220, now seen corresponding path program 1 times [2022-07-12 18:34:47,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:47,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051884902] [2022-07-12 18:34:47,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:47,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:47,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:47,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051884902] [2022-07-12 18:34:47,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051884902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:47,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495893030] [2022-07-12 18:34:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:47,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:47,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:34:47,448 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-12 18:34:47,450 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-12 18:34:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:47,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-12 18:34:47,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:34:47,598 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:34:47,598 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-12 18:34:47,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-07-12 18:34:47,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-07-12 18:34:47,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:34:47,764 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 25 treesize of output 24 [2022-07-12 18:34:47,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:34:47,771 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 25 treesize of output 24 [2022-07-12 18:34:47,825 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 18 treesize of output 20 [2022-07-12 18:34:47,829 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 18 treesize of output 20 [2022-07-12 18:34:47,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:34:47,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:34:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:47,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:34:47,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495893030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:47,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:34:47,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 23 [2022-07-12 18:34:47,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817545735] [2022-07-12 18:34:47,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:47,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:34:47,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:47,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:34:47,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:34:47,936 INFO L87 Difference]: Start difference. First operand 707 states and 910 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 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-12 18:34:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:48,560 INFO L93 Difference]: Finished difference Result 1326 states and 1648 transitions. [2022-07-12 18:34:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:34:48,560 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 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-12 18:34:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:48,563 INFO L225 Difference]: With dead ends: 1326 [2022-07-12 18:34:48,563 INFO L226 Difference]: Without dead ends: 1326 [2022-07-12 18:34:48,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2022-07-12 18:34:48,563 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 718 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:48,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1823 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:34:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2022-07-12 18:34:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 710. [2022-07-12 18:34:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 645 states have (on average 1.3488372093023255) internal successors, (870), 681 states have internal predecessors, (870), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 912 transitions. [2022-07-12 18:34:48,573 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 912 transitions. Word has length 52 [2022-07-12 18:34:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:48,573 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 912 transitions. [2022-07-12 18:34:48,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 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-12 18:34:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 912 transitions. [2022-07-12 18:34:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 18:34:48,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:48,574 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:48,592 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-12 18:34:48,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:48,795 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash 945744203, now seen corresponding path program 1 times [2022-07-12 18:34:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:48,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745863616] [2022-07-12 18:34:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745863616] [2022-07-12 18:34:49,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745863616] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771764378] [2022-07-12 18:34:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:49,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:49,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:34:49,100 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-12 18:34:49,101 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-12 18:34:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:49,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-12 18:34:49,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:34:49,350 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:34:49,351 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-12 18:34:49,551 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-12 18:34:49,557 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-12 18:34:49,584 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-12 18:34:49,589 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-12 18:34:49,618 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-12 18:34:49,624 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-12 18:34:49,689 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 18:34:49,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 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-12 18:34:49,698 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 18:34:49,699 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 19 treesize of output 18 [2022-07-12 18:34:50,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:34:50,016 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:34:50,016 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 61 treesize of output 43 [2022-07-12 18:34:50,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:34:50,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:34:50,024 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 59 treesize of output 53 [2022-07-12 18:34:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:50,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:34:50,390 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_516 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_516))) (store .cse1 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse1 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (or (forall ((v_ArrVal_516 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_516))) (store .cse2 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse2 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))) 1)) (forall ((v_ArrVal_517 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_517))) (store .cse3 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse3 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.offset|))) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))) 0)))) is different from false [2022-07-12 18:34:51,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771764378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:51,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:34:51,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 21 [2022-07-12 18:34:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911435141] [2022-07-12 18:34:51,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:34:51,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 18:34:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 18:34:51,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=749, Unknown=3, NotChecked=56, Total=930 [2022-07-12 18:34:51,840 INFO L87 Difference]: Start difference. First operand 710 states and 912 transitions. Second operand has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 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-12 18:34:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:52,901 INFO L93 Difference]: Finished difference Result 840 states and 1061 transitions. [2022-07-12 18:34:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:34:52,902 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 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 52 [2022-07-12 18:34:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:52,903 INFO L225 Difference]: With dead ends: 840 [2022-07-12 18:34:52,903 INFO L226 Difference]: Without dead ends: 840 [2022-07-12 18:34:52,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=342, Invalid=1729, Unknown=3, NotChecked=88, Total=2162 [2022-07-12 18:34:52,903 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 329 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:52,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 2529 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 972 Invalid, 0 Unknown, 409 Unchecked, 0.4s Time] [2022-07-12 18:34:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-07-12 18:34:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 776. [2022-07-12 18:34:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 708 states have (on average 1.3432203389830508) internal successors, (951), 745 states have internal predecessors, (951), 15 states have call successors, (15), 8 states have call predecessors, (15), 16 states have return successors, (30), 22 states have call predecessors, (30), 15 states have call successors, (30) [2022-07-12 18:34:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 996 transitions. [2022-07-12 18:34:52,910 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 996 transitions. Word has length 52 [2022-07-12 18:34:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:52,911 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 996 transitions. [2022-07-12 18:34:52,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 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-12 18:34:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 996 transitions. [2022-07-12 18:34:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 18:34:52,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:52,912 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:52,928 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-12 18:34:53,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:53,123 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:53,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 945744204, now seen corresponding path program 1 times [2022-07-12 18:34:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:53,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906312994] [2022-07-12 18:34:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:53,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:53,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906312994] [2022-07-12 18:34:53,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906312994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:53,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:53,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 18:34:53,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808592024] [2022-07-12 18:34:53,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:53,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:34:53,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:53,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:34:53,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:34:53,377 INFO L87 Difference]: Start difference. First operand 776 states and 996 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 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-12 18:34:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:54,358 INFO L93 Difference]: Finished difference Result 1538 states and 1900 transitions. [2022-07-12 18:34:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:34:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 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-12 18:34:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:54,361 INFO L225 Difference]: With dead ends: 1538 [2022-07-12 18:34:54,361 INFO L226 Difference]: Without dead ends: 1538 [2022-07-12 18:34:54,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:34:54,361 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 1013 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:54,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 2707 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 18:34:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-07-12 18:34:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 698. [2022-07-12 18:34:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 633 states have (on average 1.3554502369668247) internal successors, (858), 669 states have internal predecessors, (858), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-12 18:34:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 900 transitions. [2022-07-12 18:34:54,372 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 900 transitions. Word has length 52 [2022-07-12 18:34:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:54,373 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 900 transitions. [2022-07-12 18:34:54,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 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-12 18:34:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 900 transitions. [2022-07-12 18:34:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 18:34:54,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:54,374 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:54,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-07-12 18:34:54,374 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash -689191823, now seen corresponding path program 1 times [2022-07-12 18:34:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:54,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764466561] [2022-07-12 18:34:54,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:54,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:54,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764466561] [2022-07-12 18:34:54,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764466561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:54,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:54,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 18:34:54,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6360074] [2022-07-12 18:34:54,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:54,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 18:34:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:54,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 18:34:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:34:54,728 INFO L87 Difference]: Start difference. First operand 698 states and 900 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-12 18:34:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:56,421 INFO L93 Difference]: Finished difference Result 1954 states and 2517 transitions. [2022-07-12 18:34:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 18:34:56,421 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 53 [2022-07-12 18:34:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:56,424 INFO L225 Difference]: With dead ends: 1954 [2022-07-12 18:34:56,424 INFO L226 Difference]: Without dead ends: 1954 [2022-07-12 18:34:56,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=480, Invalid=1682, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 18:34:56,425 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 2337 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:56,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 1681 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:34:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2022-07-12 18:34:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 818. [2022-07-12 18:34:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 741 states have (on average 1.3522267206477734) internal successors, (1002), 780 states have internal predecessors, (1002), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 27 states have call predecessors, (40), 20 states have call successors, (40) [2022-07-12 18:34:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1062 transitions. [2022-07-12 18:34:56,437 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1062 transitions. Word has length 53 [2022-07-12 18:34:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:56,437 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1062 transitions. [2022-07-12 18:34:56,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-12 18:34:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1062 transitions. [2022-07-12 18:34:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 18:34:56,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:56,438 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:56,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-07-12 18:34:56,438 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:56,438 INFO L85 PathProgramCache]: Analyzing trace with hash -689191822, now seen corresponding path program 1 times [2022-07-12 18:34:56,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:56,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809648913] [2022-07-12 18:34:56,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:56,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:56,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:56,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809648913] [2022-07-12 18:34:56,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809648913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:56,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:56,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 18:34:56,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608158001] [2022-07-12 18:34:56,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:56,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 18:34:56,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:56,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 18:34:56,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:34:56,834 INFO L87 Difference]: Start difference. First operand 818 states and 1062 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-12 18:34:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:57,988 INFO L93 Difference]: Finished difference Result 1761 states and 2266 transitions. [2022-07-12 18:34:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 18:34:57,988 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 53 [2022-07-12 18:34:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:57,991 INFO L225 Difference]: With dead ends: 1761 [2022-07-12 18:34:57,991 INFO L226 Difference]: Without dead ends: 1761 [2022-07-12 18:34:57,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=1122, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 18:34:57,992 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 2811 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2813 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:57,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2813 Valid, 1316 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:34:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2022-07-12 18:34:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 818. [2022-07-12 18:34:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 780 states have internal predecessors, (1001), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 27 states have call predecessors, (40), 20 states have call successors, (40) [2022-07-12 18:34:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1061 transitions. [2022-07-12 18:34:58,003 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1061 transitions. Word has length 53 [2022-07-12 18:34:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:58,003 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1061 transitions. [2022-07-12 18:34:58,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-12 18:34:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1061 transitions. [2022-07-12 18:34:58,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 18:34:58,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:58,004 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:58,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-07-12 18:34:58,004 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash -687344781, now seen corresponding path program 1 times [2022-07-12 18:34:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:58,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092847088] [2022-07-12 18:34:58,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:58,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:58,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:58,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092847088] [2022-07-12 18:34:58,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092847088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:58,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:58,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:34:58,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473186559] [2022-07-12 18:34:58,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:58,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:34:58,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:58,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:34:58,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:34:58,172 INFO L87 Difference]: Start difference. First operand 818 states and 1061 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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-12 18:34:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:58,638 INFO L93 Difference]: Finished difference Result 1574 states and 2047 transitions. [2022-07-12 18:34:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:34:58,638 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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 53 [2022-07-12 18:34:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:58,641 INFO L225 Difference]: With dead ends: 1574 [2022-07-12 18:34:58,641 INFO L226 Difference]: Without dead ends: 1574 [2022-07-12 18:34:58,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:34:58,642 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 1305 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:58,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 1061 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:34:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2022-07-12 18:34:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1141. [2022-07-12 18:34:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1028 states have (on average 1.3375486381322956) internal successors, (1375), 1076 states have internal predecessors, (1375), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 45 states have call predecessors, (76), 38 states have call successors, (76) [2022-07-12 18:34:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1489 transitions. [2022-07-12 18:34:58,659 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1489 transitions. Word has length 53 [2022-07-12 18:34:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:58,659 INFO L495 AbstractCegarLoop]: Abstraction has 1141 states and 1489 transitions. [2022-07-12 18:34:58,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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-12 18:34:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1489 transitions. [2022-07-12 18:34:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 18:34:58,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:58,660 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:58,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-07-12 18:34:58,660 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -687344780, now seen corresponding path program 1 times [2022-07-12 18:34:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:58,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094985799] [2022-07-12 18:34:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:58,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:58,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094985799] [2022-07-12 18:34:58,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094985799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:58,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:58,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:34:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268049357] [2022-07-12 18:34:58,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:58,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:34:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:34:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:34:58,882 INFO L87 Difference]: Start difference. First operand 1141 states and 1489 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 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-12 18:34:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:59,309 INFO L93 Difference]: Finished difference Result 1495 states and 1941 transitions. [2022-07-12 18:34:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:34:59,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 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 53 [2022-07-12 18:34:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:59,312 INFO L225 Difference]: With dead ends: 1495 [2022-07-12 18:34:59,312 INFO L226 Difference]: Without dead ends: 1495 [2022-07-12 18:34:59,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:34:59,313 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1115 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:59,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 873 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:34:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-07-12 18:34:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1218. [2022-07-12 18:34:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1097 states have (on average 1.3409298085688242) internal successors, (1471), 1147 states have internal predecessors, (1471), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 49 states have call predecessors, (84), 42 states have call successors, (84) [2022-07-12 18:34:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1597 transitions. [2022-07-12 18:34:59,326 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1597 transitions. Word has length 53 [2022-07-12 18:34:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:59,327 INFO L495 AbstractCegarLoop]: Abstraction has 1218 states and 1597 transitions. [2022-07-12 18:34:59,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 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-12 18:34:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1597 transitions. [2022-07-12 18:34:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 18:34:59,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:59,328 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:34:59,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-07-12 18:34:59,328 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:34:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash -887259092, now seen corresponding path program 1 times [2022-07-12 18:34:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:59,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373435592] [2022-07-12 18:34:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:34:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:34:59,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:59,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373435592] [2022-07-12 18:34:59,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373435592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:59,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:34:59,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:34:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825820911] [2022-07-12 18:34:59,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:59,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:34:59,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:59,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:34:59,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:34:59,569 INFO L87 Difference]: Start difference. First operand 1218 states and 1597 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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-12 18:35:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:00,365 INFO L93 Difference]: Finished difference Result 2637 states and 3465 transitions. [2022-07-12 18:35:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 18:35:00,365 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 53 [2022-07-12 18:35:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:00,369 INFO L225 Difference]: With dead ends: 2637 [2022-07-12 18:35:00,369 INFO L226 Difference]: Without dead ends: 2637 [2022-07-12 18:35:00,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2022-07-12 18:35:00,370 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 766 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:00,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 2321 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:35:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2022-07-12 18:35:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 1549. [2022-07-12 18:35:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1404 states have (on average 1.3418803418803418) internal successors, (1884), 1460 states have internal predecessors, (1884), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 61 states have call predecessors, (108), 54 states have call successors, (108) [2022-07-12 18:35:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2046 transitions. [2022-07-12 18:35:00,385 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2046 transitions. Word has length 53 [2022-07-12 18:35:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:00,385 INFO L495 AbstractCegarLoop]: Abstraction has 1549 states and 2046 transitions. [2022-07-12 18:35:00,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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-12 18:35:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2046 transitions. [2022-07-12 18:35:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 18:35:00,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:00,386 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:35:00,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-07-12 18:35:00,386 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:00,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash -887259091, now seen corresponding path program 1 times [2022-07-12 18:35:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:00,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190010268] [2022-07-12 18:35:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:00,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:00,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:00,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190010268] [2022-07-12 18:35:00,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190010268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:00,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:00,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:35:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7463933] [2022-07-12 18:35:00,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:00,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:35:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:00,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:35:00,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:35:00,707 INFO L87 Difference]: Start difference. First operand 1549 states and 2046 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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-12 18:35:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:01,524 INFO L93 Difference]: Finished difference Result 2618 states and 3447 transitions. [2022-07-12 18:35:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:35:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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 53 [2022-07-12 18:35:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:01,531 INFO L225 Difference]: With dead ends: 2618 [2022-07-12 18:35:01,531 INFO L226 Difference]: Without dead ends: 2618 [2022-07-12 18:35:01,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-07-12 18:35:01,531 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 799 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:01,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2134 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:35:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-07-12 18:35:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1332. [2022-07-12 18:35:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1211 states have (on average 1.347646573080099) internal successors, (1632), 1261 states have internal predecessors, (1632), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 49 states have call predecessors, (84), 42 states have call successors, (84) [2022-07-12 18:35:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1758 transitions. [2022-07-12 18:35:01,546 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1758 transitions. Word has length 53 [2022-07-12 18:35:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:01,546 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 1758 transitions. [2022-07-12 18:35:01,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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-12 18:35:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1758 transitions. [2022-07-12 18:35:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 18:35:01,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:01,547 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:35:01,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-07-12 18:35:01,548 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:01,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:01,548 INFO L85 PathProgramCache]: Analyzing trace with hash 109888723, now seen corresponding path program 1 times [2022-07-12 18:35:01,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:01,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330301690] [2022-07-12 18:35:01,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:01,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:01,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330301690] [2022-07-12 18:35:01,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330301690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:01,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:01,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:35:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980039858] [2022-07-12 18:35:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:01,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:35:01,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:01,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:35:01,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:35:01,744 INFO L87 Difference]: Start difference. First operand 1332 states and 1758 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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-12 18:35:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:02,055 INFO L93 Difference]: Finished difference Result 1732 states and 2277 transitions. [2022-07-12 18:35:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:35:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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 54 [2022-07-12 18:35:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:02,058 INFO L225 Difference]: With dead ends: 1732 [2022-07-12 18:35:02,058 INFO L226 Difference]: Without dead ends: 1732 [2022-07-12 18:35:02,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:35:02,058 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1323 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:02,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1002 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:35:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2022-07-12 18:35:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1421. [2022-07-12 18:35:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1292 states have (on average 1.3506191950464397) internal successors, (1745), 1344 states have internal predecessors, (1745), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 53 states have call predecessors, (92), 46 states have call successors, (92) [2022-07-12 18:35:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1883 transitions. [2022-07-12 18:35:02,070 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1883 transitions. Word has length 54 [2022-07-12 18:35:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:02,071 INFO L495 AbstractCegarLoop]: Abstraction has 1421 states and 1883 transitions. [2022-07-12 18:35:02,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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-12 18:35:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1883 transitions. [2022-07-12 18:35:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 18:35:02,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:02,071 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:35:02,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-07-12 18:35:02,072 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:02,072 INFO L85 PathProgramCache]: Analyzing trace with hash 167147025, now seen corresponding path program 1 times [2022-07-12 18:35:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:02,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636038196] [2022-07-12 18:35:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:02,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:02,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:02,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636038196] [2022-07-12 18:35:02,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636038196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:02,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:02,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:35:02,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045124655] [2022-07-12 18:35:02,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:02,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:35:02,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:02,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:35:02,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:35:02,232 INFO L87 Difference]: Start difference. First operand 1421 states and 1883 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-12 18:35:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:02,485 INFO L93 Difference]: Finished difference Result 2036 states and 2686 transitions. [2022-07-12 18:35:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:35:02,486 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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 54 [2022-07-12 18:35:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:02,497 INFO L225 Difference]: With dead ends: 2036 [2022-07-12 18:35:02,497 INFO L226 Difference]: Without dead ends: 2036 [2022-07-12 18:35:02,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:35:02,498 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 923 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:02,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 973 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:35:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-07-12 18:35:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1715. [2022-07-12 18:35:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1554 states have (on average 1.3468468468468469) internal successors, (2093), 1614 states have internal predecessors, (2093), 62 states have call successors, (62), 31 states have call predecessors, (62), 62 states have return successors, (124), 69 states have call predecessors, (124), 62 states have call successors, (124) [2022-07-12 18:35:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2279 transitions. [2022-07-12 18:35:02,514 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2279 transitions. Word has length 54 [2022-07-12 18:35:02,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:02,514 INFO L495 AbstractCegarLoop]: Abstraction has 1715 states and 2279 transitions. [2022-07-12 18:35:02,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-12 18:35:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2279 transitions. [2022-07-12 18:35:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 18:35:02,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:02,515 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:35:02,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-07-12 18:35:02,515 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:02,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1735229320, now seen corresponding path program 1 times [2022-07-12 18:35:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:02,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719287396] [2022-07-12 18:35:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:02,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:02,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:02,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719287396] [2022-07-12 18:35:02,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719287396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:02,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:02,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 18:35:02,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98138466] [2022-07-12 18:35:02,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:02,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:35:02,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:02,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:35:02,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:35:02,688 INFO L87 Difference]: Start difference. First operand 1715 states and 2279 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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-12 18:35:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:03,384 INFO L93 Difference]: Finished difference Result 3043 states and 4052 transitions. [2022-07-12 18:35:03,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 18:35:03,385 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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 54 [2022-07-12 18:35:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:03,389 INFO L225 Difference]: With dead ends: 3043 [2022-07-12 18:35:03,390 INFO L226 Difference]: Without dead ends: 3043 [2022-07-12 18:35:03,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 18:35:03,390 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 744 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:03,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 2944 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:35:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2022-07-12 18:35:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 1497. [2022-07-12 18:35:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1360 states have (on average 1.35) internal successors, (1836), 1414 states have internal predecessors, (1836), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 57 states have call predecessors, (100), 50 states have call successors, (100) [2022-07-12 18:35:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1986 transitions. [2022-07-12 18:35:03,409 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1986 transitions. Word has length 54 [2022-07-12 18:35:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:03,409 INFO L495 AbstractCegarLoop]: Abstraction has 1497 states and 1986 transitions. [2022-07-12 18:35:03,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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-12 18:35:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1986 transitions. [2022-07-12 18:35:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 18:35:03,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:03,410 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:35:03,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-07-12 18:35:03,410 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1769661897, now seen corresponding path program 1 times [2022-07-12 18:35:03,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:03,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967772098] [2022-07-12 18:35:03,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:03,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:03,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967772098] [2022-07-12 18:35:03,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967772098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:03,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:03,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 18:35:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029936357] [2022-07-12 18:35:03,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:03,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 18:35:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:03,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 18:35:03,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:35:03,689 INFO L87 Difference]: Start difference. First operand 1497 states and 1986 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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-12 18:35:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:05,207 INFO L93 Difference]: Finished difference Result 2770 states and 3674 transitions. [2022-07-12 18:35:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 18:35:05,208 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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 56 [2022-07-12 18:35:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:05,217 INFO L225 Difference]: With dead ends: 2770 [2022-07-12 18:35:05,217 INFO L226 Difference]: Without dead ends: 2770 [2022-07-12 18:35:05,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=439, Invalid=1541, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 18:35:05,222 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 2587 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2589 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:05,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2589 Valid, 1449 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:35:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2022-07-12 18:35:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 1509. [2022-07-12 18:35:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1372 states have (on average 1.349125364431487) internal successors, (1851), 1426 states have internal predecessors, (1851), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 57 states have call predecessors, (100), 50 states have call successors, (100) [2022-07-12 18:35:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2001 transitions. [2022-07-12 18:35:05,252 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2001 transitions. Word has length 56 [2022-07-12 18:35:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:05,252 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2001 transitions. [2022-07-12 18:35:05,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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-12 18:35:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2001 transitions. [2022-07-12 18:35:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 18:35:05,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:05,254 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:35:05,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-07-12 18:35:05,255 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1715958773, now seen corresponding path program 1 times [2022-07-12 18:35:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:05,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717959953] [2022-07-12 18:35:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:05,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:05,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717959953] [2022-07-12 18:35:05,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717959953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:05,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:05,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:35:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762938506] [2022-07-12 18:35:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:05,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:35:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:05,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:35:05,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:35:05,387 INFO L87 Difference]: Start difference. First operand 1509 states and 2001 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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-12 18:35:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:05,721 INFO L93 Difference]: Finished difference Result 2126 states and 2807 transitions. [2022-07-12 18:35:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:35:05,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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 56 [2022-07-12 18:35:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:05,724 INFO L225 Difference]: With dead ends: 2126 [2022-07-12 18:35:05,724 INFO L226 Difference]: Without dead ends: 2126 [2022-07-12 18:35:05,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:35:05,725 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 883 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:05,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 792 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:35:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2022-07-12 18:35:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 1803. [2022-07-12 18:35:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1634 states have (on average 1.3457772337821297) internal successors, (2199), 1696 states have internal predecessors, (2199), 66 states have call successors, (66), 33 states have call predecessors, (66), 66 states have return successors, (132), 73 states have call predecessors, (132), 66 states have call successors, (132) [2022-07-12 18:35:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2397 transitions. [2022-07-12 18:35:05,743 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2397 transitions. Word has length 56 [2022-07-12 18:35:05,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:05,743 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 2397 transitions. [2022-07-12 18:35:05,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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-12 18:35:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2397 transitions. [2022-07-12 18:35:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 18:35:05,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:05,744 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-12 18:35:05,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-07-12 18:35:05,744 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash -773838198, now seen corresponding path program 1 times [2022-07-12 18:35:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:05,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022232455] [2022-07-12 18:35:05,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:05,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 18:35:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:35:05,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:05,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022232455] [2022-07-12 18:35:05,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022232455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:05,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:05,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:35:05,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587141335] [2022-07-12 18:35:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:05,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:35:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:05,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:35:05,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:35:05,794 INFO L87 Difference]: Start difference. First operand 1803 states and 2397 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 18:35:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:05,863 INFO L93 Difference]: Finished difference Result 2155 states and 2840 transitions. [2022-07-12 18:35:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:35:05,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-07-12 18:35:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:05,866 INFO L225 Difference]: With dead ends: 2155 [2022-07-12 18:35:05,866 INFO L226 Difference]: Without dead ends: 2155 [2022-07-12 18:35:05,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:35:05,866 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 312 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:05,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 497 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:35:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2022-07-12 18:35:05,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 1802. [2022-07-12 18:35:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1634 states have (on average 1.3347613219094248) internal successors, (2181), 1695 states have internal predecessors, (2181), 66 states have call successors, (66), 33 states have call predecessors, (66), 66 states have return successors, (132), 73 states have call predecessors, (132), 66 states have call successors, (132) [2022-07-12 18:35:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2379 transitions. [2022-07-12 18:35:05,882 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2379 transitions. Word has length 57 [2022-07-12 18:35:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:05,882 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 2379 transitions. [2022-07-12 18:35:05,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 18:35:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2379 transitions. [2022-07-12 18:35:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 18:35:05,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:05,883 INFO L195 NwaCegarLoop]: trace histogram [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-12 18:35:05,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-07-12 18:35:05,884 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:05,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:05,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1106607972, now seen corresponding path program 1 times [2022-07-12 18:35:05,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:05,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620828064] [2022-07-12 18:35:05,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:05,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:06,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:06,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:06,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620828064] [2022-07-12 18:35:06,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620828064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:06,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:06,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:35:06,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316854620] [2022-07-12 18:35:06,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:06,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:35:06,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:06,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:35:06,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:35:06,096 INFO L87 Difference]: Start difference. First operand 1802 states and 2379 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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-12 18:35:06,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:06,780 INFO L93 Difference]: Finished difference Result 2781 states and 3648 transitions. [2022-07-12 18:35:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:35:06,795 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 56 [2022-07-12 18:35:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:06,798 INFO L225 Difference]: With dead ends: 2781 [2022-07-12 18:35:06,798 INFO L226 Difference]: Without dead ends: 2781 [2022-07-12 18:35:06,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2022-07-12 18:35:06,799 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 721 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:06,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 2276 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:35:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2022-07-12 18:35:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 1500. [2022-07-12 18:35:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1364 states have (on average 1.3394428152492668) internal successors, (1827), 1417 states have internal predecessors, (1827), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 57 states have call predecessors, (100), 50 states have call successors, (100) [2022-07-12 18:35:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1977 transitions. [2022-07-12 18:35:06,815 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1977 transitions. Word has length 56 [2022-07-12 18:35:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:06,815 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 1977 transitions. [2022-07-12 18:35:06,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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-12 18:35:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1977 transitions. [2022-07-12 18:35:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 18:35:06,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:06,816 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-12 18:35:06,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-07-12 18:35:06,816 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1780819851, now seen corresponding path program 1 times [2022-07-12 18:35:06,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:06,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161150877] [2022-07-12 18:35:06,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:06,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:07,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 18:35:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:35:07,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:07,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161150877] [2022-07-12 18:35:07,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161150877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:07,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:07,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 18:35:07,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970901707] [2022-07-12 18:35:07,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:07,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 18:35:07,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:07,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 18:35:07,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:35:07,165 INFO L87 Difference]: Start difference. First operand 1500 states and 1977 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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-12 18:35:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:08,374 INFO L93 Difference]: Finished difference Result 3526 states and 4713 transitions. [2022-07-12 18:35:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:35:08,375 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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 58 [2022-07-12 18:35:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:08,379 INFO L225 Difference]: With dead ends: 3526 [2022-07-12 18:35:08,379 INFO L226 Difference]: Without dead ends: 3524 [2022-07-12 18:35:08,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=931, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 18:35:08,380 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 1706 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:08,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 2742 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:35:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2022-07-12 18:35:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 1602. [2022-07-12 18:35:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1454 states have (on average 1.3321870701513068) internal successors, (1937), 1510 states have internal predecessors, (1937), 56 states have call successors, (56), 28 states have call predecessors, (56), 56 states have return successors, (112), 63 states have call predecessors, (112), 56 states have call successors, (112) [2022-07-12 18:35:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2105 transitions. [2022-07-12 18:35:08,401 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2105 transitions. Word has length 58 [2022-07-12 18:35:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:08,401 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2105 transitions. [2022-07-12 18:35:08,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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-12 18:35:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2105 transitions. [2022-07-12 18:35:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 18:35:08,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:08,402 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:35:08,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-07-12 18:35:08,402 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:08,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash 765562808, now seen corresponding path program 1 times [2022-07-12 18:35:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:08,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930908877] [2022-07-12 18:35:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:08,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:08,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 18:35:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:35:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:08,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930908877] [2022-07-12 18:35:08,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930908877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:08,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275318027] [2022-07-12 18:35:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:08,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:08,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:35:08,772 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-12 18:35:08,773 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-12 18:35:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:08,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 18:35:08,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:35:08,975 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-12 18:35:09,228 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-12 18:35:09,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:09,274 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-12 18:35:09,377 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 18:35:09,377 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 21 treesize of output 29 [2022-07-12 18:35:09,432 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-12 18:35:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:09,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:35:09,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275318027] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:09,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:35:09,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2022-07-12 18:35:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178112305] [2022-07-12 18:35:09,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:35:09,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 18:35:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 18:35:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2022-07-12 18:35:09,515 INFO L87 Difference]: Start difference. First operand 1602 states and 2105 transitions. Second operand has 27 states, 26 states have (on average 4.0) internal successors, (104), 24 states have internal predecessors, (104), 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-12 18:35:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:10,646 INFO L93 Difference]: Finished difference Result 2802 states and 3668 transitions. [2022-07-12 18:35:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 18:35:10,646 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 24 states have internal predecessors, (104), 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 58 [2022-07-12 18:35:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:10,649 INFO L225 Difference]: With dead ends: 2802 [2022-07-12 18:35:10,650 INFO L226 Difference]: Without dead ends: 2802 [2022-07-12 18:35:10,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2022-07-12 18:35:10,650 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 2834 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2835 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:10,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2835 Valid, 2243 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:35:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2022-07-12 18:35:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 1632. [2022-07-12 18:35:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1484 states have (on average 1.3335579514824798) internal successors, (1979), 1537 states have internal predecessors, (1979), 56 states have call successors, (56), 28 states have call predecessors, (56), 56 states have return successors, (112), 66 states have call predecessors, (112), 56 states have call successors, (112) [2022-07-12 18:35:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2147 transitions. [2022-07-12 18:35:10,667 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2147 transitions. Word has length 58 [2022-07-12 18:35:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:10,668 INFO L495 AbstractCegarLoop]: Abstraction has 1632 states and 2147 transitions. [2022-07-12 18:35:10,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 24 states have internal predecessors, (104), 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-12 18:35:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2147 transitions. [2022-07-12 18:35:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 18:35:10,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:10,669 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:35:10,699 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-12 18:35:10,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:10,887 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 765562809, now seen corresponding path program 1 times [2022-07-12 18:35:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:10,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833885463] [2022-07-12 18:35:10,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:11,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:11,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 18:35:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:35:11,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:11,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833885463] [2022-07-12 18:35:11,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833885463] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:11,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12338366] [2022-07-12 18:35:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:11,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:11,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:35:11,328 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-12 18:35:11,329 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-12 18:35:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:11,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-12 18:35:11,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:35:11,484 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-12 18:35:11,787 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-12 18:35:11,793 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-12 18:35:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:11,861 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 42 treesize of output 33 [2022-07-12 18:35:11,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:11,867 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 42 treesize of output 33 [2022-07-12 18:35:12,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:12,047 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 18 treesize of output 20 [2022-07-12 18:35:12,053 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-12 18:35:12,053 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 17 treesize of output 17 [2022-07-12 18:35:12,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:35:12,215 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 36 treesize of output 14 [2022-07-12 18:35:12,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:35:12,219 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 9 [2022-07-12 18:35:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:12,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:35:18,499 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:35:18,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12338366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:18,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:35:18,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 32 [2022-07-12 18:35:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104198663] [2022-07-12 18:35:18,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:35:18,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 18:35:18,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 18:35:18,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1335, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 18:35:18,613 INFO L87 Difference]: Start difference. First operand 1632 states and 2147 transitions. Second operand has 33 states, 32 states have (on average 3.34375) internal successors, (107), 30 states have internal predecessors, (107), 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-12 18:35:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:22,314 INFO L93 Difference]: Finished difference Result 3320 states and 4309 transitions. [2022-07-12 18:35:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-12 18:35:22,315 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.34375) internal successors, (107), 30 states have internal predecessors, (107), 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-12 18:35:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:22,320 INFO L225 Difference]: With dead ends: 3320 [2022-07-12 18:35:22,320 INFO L226 Difference]: Without dead ends: 3320 [2022-07-12 18:35:22,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1114, Invalid=5528, Unknown=0, NotChecked=0, Total=6642 [2022-07-12 18:35:22,321 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 5099 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5100 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:22,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5100 Valid, 2484 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 18:35:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2022-07-12 18:35:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 1642. [2022-07-12 18:35:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1494 states have (on average 1.3326639892904952) internal successors, (1991), 1546 states have internal predecessors, (1991), 56 states have call successors, (56), 28 states have call predecessors, (56), 56 states have return successors, (112), 67 states have call predecessors, (112), 56 states have call successors, (112) [2022-07-12 18:35:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2159 transitions. [2022-07-12 18:35:22,368 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2159 transitions. Word has length 58 [2022-07-12 18:35:22,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:22,368 INFO L495 AbstractCegarLoop]: Abstraction has 1642 states and 2159 transitions. [2022-07-12 18:35:22,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.34375) internal successors, (107), 30 states have internal predecessors, (107), 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-12 18:35:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2159 transitions. [2022-07-12 18:35:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 18:35:22,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:22,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:35:22,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:35:22,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:22,584 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash -581458318, now seen corresponding path program 1 times [2022-07-12 18:35:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:22,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87224054] [2022-07-12 18:35:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:22,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:22,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 18:35:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:35:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:22,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87224054] [2022-07-12 18:35:22,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87224054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:22,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:22,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 18:35:22,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179105479] [2022-07-12 18:35:22,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:22,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 18:35:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:22,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 18:35:22,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:35:22,921 INFO L87 Difference]: Start difference. First operand 1642 states and 2159 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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-12 18:35:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:24,337 INFO L93 Difference]: Finished difference Result 3326 states and 4464 transitions. [2022-07-12 18:35:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 18:35:24,338 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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 58 [2022-07-12 18:35:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:24,342 INFO L225 Difference]: With dead ends: 3326 [2022-07-12 18:35:24,342 INFO L226 Difference]: Without dead ends: 3322 [2022-07-12 18:35:24,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 18:35:24,342 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 1600 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:24,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 2435 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:35:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2022-07-12 18:35:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 1448. [2022-07-12 18:35:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1320 states have (on average 1.3287878787878789) internal successors, (1754), 1368 states have internal predecessors, (1754), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 56 states have call predecessors, (92), 46 states have call successors, (92) [2022-07-12 18:35:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1892 transitions. [2022-07-12 18:35:24,362 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1892 transitions. Word has length 58 [2022-07-12 18:35:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:24,362 INFO L495 AbstractCegarLoop]: Abstraction has 1448 states and 1892 transitions. [2022-07-12 18:35:24,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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-12 18:35:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1892 transitions. [2022-07-12 18:35:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:35:24,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:24,363 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:35:24,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-07-12 18:35:24,363 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:24,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1541651178, now seen corresponding path program 1 times [2022-07-12 18:35:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:24,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469152180] [2022-07-12 18:35:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:24,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:24,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:24,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 18:35:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:35:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:24,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469152180] [2022-07-12 18:35:24,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469152180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:24,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655167400] [2022-07-12 18:35:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:24,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:24,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:35:24,523 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-12 18:35:24,547 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-12 18:35:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:24,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-12 18:35:24,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:35:24,707 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-12 18:35:24,978 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-12 18:35:25,153 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-12 18:35:25,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 25 treesize of output 37 [2022-07-12 18:35:25,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:35:25,244 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 21 treesize of output 9 [2022-07-12 18:35:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:25,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:35:25,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655167400] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:25,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:35:25,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-12 18:35:25,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479317877] [2022-07-12 18:35:25,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:35:25,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 18:35:25,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:25,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 18:35:25,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-07-12 18:35:25,306 INFO L87 Difference]: Start difference. First operand 1448 states and 1892 transitions. Second operand has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 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-12 18:35:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:26,087 INFO L93 Difference]: Finished difference Result 3724 states and 4918 transitions. [2022-07-12 18:35:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:35:26,095 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 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 59 [2022-07-12 18:35:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:26,100 INFO L225 Difference]: With dead ends: 3724 [2022-07-12 18:35:26,100 INFO L226 Difference]: Without dead ends: 3724 [2022-07-12 18:35:26,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 18:35:26,101 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 1170 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 3322 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:26,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 3322 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1090 Invalid, 0 Unknown, 318 Unchecked, 0.5s Time] [2022-07-12 18:35:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2022-07-12 18:35:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3305. [2022-07-12 18:35:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3050 states have (on average 1.3432786885245902) internal successors, (4097), 3126 states have internal predecessors, (4097), 116 states have call successors, (116), 52 states have call predecessors, (116), 103 states have return successors, (231), 126 states have call predecessors, (231), 116 states have call successors, (231) [2022-07-12 18:35:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4444 transitions. [2022-07-12 18:35:26,144 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4444 transitions. Word has length 59 [2022-07-12 18:35:26,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:26,144 INFO L495 AbstractCegarLoop]: Abstraction has 3305 states and 4444 transitions. [2022-07-12 18:35:26,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 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-12 18:35:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4444 transitions. [2022-07-12 18:35:26,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:35:26,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:26,146 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:35:26,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:35:26,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:26,364 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1541651179, now seen corresponding path program 1 times [2022-07-12 18:35:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:26,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138534882] [2022-07-12 18:35:26,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:26,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:26,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:26,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 18:35:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:35:26,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:26,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138534882] [2022-07-12 18:35:26,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138534882] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:26,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146232123] [2022-07-12 18:35:26,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:26,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:26,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:35:26,666 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-12 18:35:26,667 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-12 18:35:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:26,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-12 18:35:26,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:35:26,838 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-12 18:35:26,842 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-12 18:35:27,236 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-12 18:35:27,241 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-12 18:35:27,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:27,469 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 20 treesize of output 22 [2022-07-12 18:35:27,479 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 18:35:27,480 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 19 treesize of output 19 [2022-07-12 18:35:27,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:35:27,647 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 21 treesize of output 9 [2022-07-12 18:35:27,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:35:27,652 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 19 treesize of output 7 [2022-07-12 18:35:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:27,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:35:33,856 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:35:35,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146232123] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:35,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:35:35,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26 [2022-07-12 18:35:35,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843863682] [2022-07-12 18:35:35,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:35:35,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 18:35:35,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 18:35:35,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2022-07-12 18:35:35,928 INFO L87 Difference]: Start difference. First operand 3305 states and 4444 transitions. Second operand has 27 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 25 states have internal predecessors, (109), 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-12 18:35:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:37,307 INFO L93 Difference]: Finished difference Result 5034 states and 6787 transitions. [2022-07-12 18:35:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:35:37,307 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 25 states have internal predecessors, (109), 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-12 18:35:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:37,314 INFO L225 Difference]: With dead ends: 5034 [2022-07-12 18:35:37,314 INFO L226 Difference]: Without dead ends: 5034 [2022-07-12 18:35:37,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=348, Invalid=1814, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 18:35:37,315 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 1353 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:37,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 2791 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1401 Invalid, 0 Unknown, 254 Unchecked, 0.7s Time] [2022-07-12 18:35:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2022-07-12 18:35:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 4733. [2022-07-12 18:35:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4733 states, 4382 states have (on average 1.3539479689639433) internal successors, (5933), 4481 states have internal predecessors, (5933), 170 states have call successors, (170), 73 states have call predecessors, (170), 145 states have return successors, (339), 178 states have call predecessors, (339), 170 states have call successors, (339) [2022-07-12 18:35:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 6442 transitions. [2022-07-12 18:35:37,371 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 6442 transitions. Word has length 59 [2022-07-12 18:35:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:37,371 INFO L495 AbstractCegarLoop]: Abstraction has 4733 states and 6442 transitions. [2022-07-12 18:35:37,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 25 states have internal predecessors, (109), 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-12 18:35:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 6442 transitions. [2022-07-12 18:35:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:35:37,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:37,372 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:35:37,393 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-12 18:35:37,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:37,594 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:37,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1325471971, now seen corresponding path program 1 times [2022-07-12 18:35:37,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:37,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401012027] [2022-07-12 18:35:37,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:37,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:37,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 18:35:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:35:37,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:37,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401012027] [2022-07-12 18:35:37,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401012027] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:37,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356772393] [2022-07-12 18:35:37,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:37,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:37,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:35:37,929 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-12 18:35:37,955 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-12 18:35:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:38,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-12 18:35:38,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:35:38,153 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-12 18:35:38,419 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-12 18:35:38,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:38,476 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-12 18:35:38,597 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 18:35:38,597 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 21 treesize of output 29 [2022-07-12 18:35:38,657 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-12 18:35:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:38,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:35:38,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356772393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:38,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:35:38,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2022-07-12 18:35:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240964750] [2022-07-12 18:35:38,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:35:38,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 18:35:38,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:38,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 18:35:38,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:35:38,729 INFO L87 Difference]: Start difference. First operand 4733 states and 6442 transitions. Second operand has 25 states, 24 states have (on average 4.5) internal successors, (108), 21 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-12 18:35:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:40,200 INFO L93 Difference]: Finished difference Result 7562 states and 10338 transitions. [2022-07-12 18:35:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:35:40,200 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.5) internal successors, (108), 21 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 59 [2022-07-12 18:35:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:40,232 INFO L225 Difference]: With dead ends: 7562 [2022-07-12 18:35:40,232 INFO L226 Difference]: Without dead ends: 7562 [2022-07-12 18:35:40,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=1251, Unknown=0, NotChecked=0, Total=1560 [2022-07-12 18:35:40,233 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 1266 mSDsluCounter, 3502 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:40,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 3830 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 18:35:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7562 states. [2022-07-12 18:35:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7562 to 5149. [2022-07-12 18:35:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5149 states, 4756 states have (on average 1.3500841042893188) internal successors, (6421), 4857 states have internal predecessors, (6421), 184 states have call successors, (184), 87 states have call predecessors, (184), 173 states have return successors, (367), 204 states have call predecessors, (367), 184 states have call successors, (367) [2022-07-12 18:35:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 6972 transitions. [2022-07-12 18:35:40,297 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 6972 transitions. Word has length 59 [2022-07-12 18:35:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:40,297 INFO L495 AbstractCegarLoop]: Abstraction has 5149 states and 6972 transitions. [2022-07-12 18:35:40,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.5) internal successors, (108), 21 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-12 18:35:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 6972 transitions. [2022-07-12 18:35:40,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:35:40,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:40,298 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:35:40,315 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-12 18:35:40,515 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,SelfDestructingSolverStorable72 [2022-07-12 18:35:40,516 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1325471972, now seen corresponding path program 1 times [2022-07-12 18:35:40,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:40,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069230558] [2022-07-12 18:35:40,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:41,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 18:35:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:35:41,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:41,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069230558] [2022-07-12 18:35:41,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069230558] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:41,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700066092] [2022-07-12 18:35:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:41,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:41,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:35:41,138 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-12 18:35:41,139 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-12 18:35:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:41,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-12 18:35:41,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:35:41,345 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-12 18:35:41,358 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-12 18:35:41,709 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-12 18:35:41,718 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-12 18:35:41,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:41,803 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 42 treesize of output 33 [2022-07-12 18:35:41,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:41,814 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 27 treesize of output 26 [2022-07-12 18:35:41,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:41,992 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 16 treesize of output 18 [2022-07-12 18:35:41,997 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 18:35:41,997 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 15 treesize of output 15 [2022-07-12 18:35:42,100 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 19 treesize of output 7 [2022-07-12 18:35:42,104 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-12 18:35:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:42,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:35:42,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700066092] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:42,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:35:42,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 28 [2022-07-12 18:35:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703085699] [2022-07-12 18:35:42,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:35:42,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 18:35:42,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:42,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 18:35:42,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 18:35:42,322 INFO L87 Difference]: Start difference. First operand 5149 states and 6972 transitions. Second operand has 29 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 25 states have internal predecessors, (107), 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-12 18:35:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:44,749 INFO L93 Difference]: Finished difference Result 8313 states and 11372 transitions. [2022-07-12 18:35:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:35:44,750 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 25 states have internal predecessors, (107), 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 59 [2022-07-12 18:35:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:44,760 INFO L225 Difference]: With dead ends: 8313 [2022-07-12 18:35:44,760 INFO L226 Difference]: Without dead ends: 8313 [2022-07-12 18:35:44,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=539, Invalid=2113, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 18:35:44,761 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 1986 mSDsluCounter, 3427 mSDsCounter, 0 mSdLazyCounter, 2926 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 3747 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:44,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1986 Valid, 3747 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2926 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 18:35:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8313 states. [2022-07-12 18:35:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8313 to 5226. [2022-07-12 18:35:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5226 states, 4829 states have (on average 1.3491406088217022) internal successors, (6515), 4929 states have internal predecessors, (6515), 188 states have call successors, (188), 87 states have call predecessors, (188), 173 states have return successors, (375), 209 states have call predecessors, (375), 188 states have call successors, (375) [2022-07-12 18:35:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 7078 transitions. [2022-07-12 18:35:44,829 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 7078 transitions. Word has length 59 [2022-07-12 18:35:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:44,830 INFO L495 AbstractCegarLoop]: Abstraction has 5226 states and 7078 transitions. [2022-07-12 18:35:44,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 25 states have internal predecessors, (107), 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-12 18:35:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 7078 transitions. [2022-07-12 18:35:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:35:44,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:44,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:35:44,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 18:35:45,044 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,SelfDestructingSolverStorable73 [2022-07-12 18:35:45,045 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-12 18:35:45,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 726312246, now seen corresponding path program 1 times [2022-07-12 18:35:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:45,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851421064] [2022-07-12 18:35:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:45,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:35:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:46,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:46,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851421064] [2022-07-12 18:35:46,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851421064] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:35:46,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780071301] [2022-07-12 18:35:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:46,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:35:46,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:35:46,025 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-12 18:35:46,027 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-12 18:35:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:46,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-12 18:35:46,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:35:46,211 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:35:46,212 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-12 18:35:46,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-07-12 18:35:46,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-07-12 18:35:46,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:46,558 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 27 treesize of output 26 [2022-07-12 18:35:46,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:46,562 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 27 treesize of output 26 [2022-07-12 18:35:46,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:46,641 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 21 treesize of output 20 [2022-07-12 18:35:46,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:46,646 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 21 treesize of output 20 [2022-07-12 18:35:46,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:46,745 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 16 treesize of output 18 [2022-07-12 18:35:46,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:46,749 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 16 treesize of output 18 [2022-07-12 18:35:46,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:46,902 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 25 treesize of output 24 [2022-07-12 18:35:46,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:46,906 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 24 treesize of output 26 [2022-07-12 18:35:46,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:46,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:35:46,991 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 18:35:46,991 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 51 [2022-07-12 18:35:46,994 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 24 treesize of output 26 [2022-07-12 18:35:47,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:35:47,247 INFO L356 Elim1Store]: treesize reduction 27, result has 22.9 percent of original size [2022-07-12 18:35:47,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 42 [2022-07-12 18:35:47,259 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:35:47,260 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 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 18:35:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:35:47,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:35:47,501 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1684 Int) (v_ArrVal_1683 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1683) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1684)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))) 4) 0)) (forall ((v_ArrVal_1684 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1684)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))) 4) 0))) is different from false [2022-07-12 18:35:48,513 INFO L356 Elim1Store]: treesize reduction 90, result has 38.8 percent of original size [2022-07-12 18:35:48,513 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 127 [2022-07-12 18:35:48,558 INFO L356 Elim1Store]: treesize reduction 90, result has 38.8 percent of original size [2022-07-12 18:35:48,558 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 103 [2022-07-12 18:35:48,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:35:48,583 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 482 treesize of output 488 [2022-07-12 18:35:48,725 INFO L356 Elim1Store]: treesize reduction 142, result has 68.1 percent of original size [2022-07-12 18:35:48,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2704 treesize of output 2708 [2022-07-12 18:35:48,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2376 treesize of output 2308 [2022-07-12 18:35:48,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2308 treesize of output 2274 [2022-07-12 18:35:48,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4698 treesize of output 4236 [2022-07-12 18:35:49,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4