./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers2.c --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-ext3/getNumbers2.c -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 cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:27:15,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:27:15,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:27:15,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:27:15,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:27:15,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:27:15,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:27:15,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:27:15,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:27:15,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:27:15,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:27:15,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:27:15,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:27:15,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:27:15,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:27:15,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:27:15,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:27:15,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:27:15,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:27:15,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:27:15,599 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:27:15,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:27:15,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:27:15,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:27:15,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:27:15,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:27:15,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:27:15,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:27:15,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:27:15,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:27:15,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:27:15,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:27:15,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:27:15,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:27:15,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:27:15,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:27:15,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:27:15,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:27:15,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:27:15,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:27:15,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:27:15,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:27:15,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:27:15,638 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:27:15,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:27:15,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:27:15,639 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:27:15,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:27:15,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:27:15,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:27:15,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:27:15,640 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:27:15,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:27:15,641 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:27:15,641 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:27:15,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:27:15,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:27:15,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:27:15,642 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:27:15,642 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:27:15,642 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:27:15,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:27:15,643 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:27:15,643 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:27:15,643 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:27:15,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:27:15,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:27:15,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:27:15,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:27:15,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:27:15,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:27:15,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:27:15,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:27:15,645 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 -> cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd [2022-07-12 19:27:15,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:27:15,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:27:15,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:27:15,860 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:27:15,860 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:27:15,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2022-07-12 19:27:15,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a17f6a454/9cf580fe8f514504aee0baae0d8641de/FLAG831b2cc0f [2022-07-12 19:27:16,290 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:27:16,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2022-07-12 19:27:16,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a17f6a454/9cf580fe8f514504aee0baae0d8641de/FLAG831b2cc0f [2022-07-12 19:27:16,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a17f6a454/9cf580fe8f514504aee0baae0d8641de [2022-07-12 19:27:16,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:27:16,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:27:16,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:27:16,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:27:16,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:27:16,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@125c72f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16, skipping insertion in model container [2022-07-12 19:27:16,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:27:16,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:27:16,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:27:16,484 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:27:16,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:27:16,509 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:27:16,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16 WrapperNode [2022-07-12 19:27:16,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:27:16,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:27:16,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:27:16,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:27:16,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,550 INFO L137 Inliner]: procedures = 10, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2022-07-12 19:27:16,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:27:16,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:27:16,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:27:16,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:27:16,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:27:16,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:27:16,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:27:16,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:27:16,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (1/1) ... [2022-07-12 19:27:16,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:27:16,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:16,613 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 19:27:16,635 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 19:27:16,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:27:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:27:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:27:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:27:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:27:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:27:16,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:27:16,698 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:27:16,699 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:27:16,836 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:27:16,840 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:27:16,840 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 19:27:16,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:27:16 BoogieIcfgContainer [2022-07-12 19:27:16,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:27:16,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:27:16,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:27:16,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:27:16,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:27:16" (1/3) ... [2022-07-12 19:27:16,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5917fe90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:27:16, skipping insertion in model container [2022-07-12 19:27:16,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:16" (2/3) ... [2022-07-12 19:27:16,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5917fe90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:27:16, skipping insertion in model container [2022-07-12 19:27:16,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:27:16" (3/3) ... [2022-07-12 19:27:16,857 INFO L111 eAbstractionObserver]: Analyzing ICFG getNumbers2.c [2022-07-12 19:27:16,867 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:27:16,873 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-07-12 19:27:16,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:27:16,914 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@47858c81, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@29813e8b [2022-07-12 19:27:16,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-07-12 19:27:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 19:27:16,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:16,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 19:27:16,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:16,927 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-12 19:27:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:16,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367610909] [2022-07-12 19:27:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:17,097 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 19:27:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:17,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367610909] [2022-07-12 19:27:17,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367610909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:17,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:17,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-12 19:27:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506559849] [2022-07-12 19:27:17,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:17,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:17,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:17,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:17,124 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 19:27:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:17,161 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-07-12 19:27:17,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:17,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-07-12 19:27:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:17,168 INFO L225 Difference]: With dead ends: 27 [2022-07-12 19:27:17,169 INFO L226 Difference]: Without dead ends: 25 [2022-07-12 19:27:17,171 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 19:27:17,174 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:17,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-12 19:27:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-12 19:27:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-12 19:27:17,195 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 4 [2022-07-12 19:27:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:17,195 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-12 19:27:17,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 19:27:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-12 19:27:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 19:27:17,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:17,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 19:27:17,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:27:17,197 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-07-12 19:27:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:17,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383980395] [2022-07-12 19:27:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:17,275 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 19:27:17,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:17,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383980395] [2022-07-12 19:27:17,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383980395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:17,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:17,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758873329] [2022-07-12 19:27:17,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:17,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:27:17,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:17,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:27:17,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:27:17,278 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 19:27:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:17,337 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-07-12 19:27:17,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:27:17,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-07-12 19:27:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:17,338 INFO L225 Difference]: With dead ends: 28 [2022-07-12 19:27:17,338 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 19:27:17,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 19:27:17,340 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:17,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:27:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 19:27:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-12 19:27:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-07-12 19:27:17,343 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 4 [2022-07-12 19:27:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:17,344 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-07-12 19:27:17,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 19:27:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-07-12 19:27:17,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 19:27:17,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:17,345 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-07-12 19:27:17,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:27:17,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:17,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2022-07-12 19:27:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:17,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356863563] [2022-07-12 19:27:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:27:17,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:17,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356863563] [2022-07-12 19:27:17,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356863563] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:17,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843175618] [2022-07-12 19:27:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:17,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:17,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:17,468 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 19:27:17,487 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 19:27:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:17,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:27:17,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:27:17,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:27:17,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843175618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:17,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:17,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2022-07-12 19:27:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931371348] [2022-07-12 19:27:17,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:17,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:27:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:17,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:27:17,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:27:17,641 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:17,793 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-12 19:27:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:27:17,793 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-12 19:27:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:17,794 INFO L225 Difference]: With dead ends: 34 [2022-07-12 19:27:17,794 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 19:27:17,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-07-12 19:27:17,795 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 92 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:17,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 35 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 19:27:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-12 19:27:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-07-12 19:27:17,799 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 7 [2022-07-12 19:27:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:17,799 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-07-12 19:27:17,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-07-12 19:27:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 19:27:17,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:17,800 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:17,834 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 19:27:18,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:18,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2022-07-12 19:27:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:18,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037715350] [2022-07-12 19:27:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:18,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:27:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:18,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037715350] [2022-07-12 19:27:18,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037715350] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:18,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699975377] [2022-07-12 19:27:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:18,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:18,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:18,091 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 19:27:18,092 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 19:27:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:18,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:27:18,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:27:18,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:27:18,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699975377] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:18,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:18,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-12 19:27:18,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925836423] [2022-07-12 19:27:18,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:18,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 19:27:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:18,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 19:27:18,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:27:18,230 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 19:27:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:18,269 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-12 19:27:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:27:18,269 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 19:27:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:18,271 INFO L225 Difference]: With dead ends: 52 [2022-07-12 19:27:18,271 INFO L226 Difference]: Without dead ends: 52 [2022-07-12 19:27:18,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:27:18,273 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:18,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 62 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-12 19:27:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-12 19:27:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 51 states have internal predecessors, (53), 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 19:27:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-07-12 19:27:18,289 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 19 [2022-07-12 19:27:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:18,290 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-07-12 19:27:18,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 19:27:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-07-12 19:27:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:27:18,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:18,292 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:18,308 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 19:27:18,508 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,SelfDestructingSolverStorable3 [2022-07-12 19:27:18,509 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:18,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069290, now seen corresponding path program 2 times [2022-07-12 19:27:18,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:18,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530108208] [2022-07-12 19:27:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:18,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:18,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530108208] [2022-07-12 19:27:18,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530108208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:18,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:18,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:27:18,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554123419] [2022-07-12 19:27:18,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:18,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:27:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:18,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:27:18,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:27:18,668 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 19:27:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:18,715 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-07-12 19:27:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:27:18,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 37 [2022-07-12 19:27:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:18,717 INFO L225 Difference]: With dead ends: 60 [2022-07-12 19:27:18,717 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 19:27:18,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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 19:27:18,717 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:18,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 26 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 19:27:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-07-12 19:27:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 states have internal predecessors, (56), 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 19:27:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-07-12 19:27:18,721 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 37 [2022-07-12 19:27:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:18,721 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-12 19:27:18,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 19:27:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-07-12 19:27:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:27:18,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:18,722 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:18,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:27:18,722 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 1 times [2022-07-12 19:27:18,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:18,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298548356] [2022-07-12 19:27:18,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:18,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:18,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298548356] [2022-07-12 19:27:18,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298548356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:18,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:18,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:27:18,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74782364] [2022-07-12 19:27:18,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:18,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:27:18,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:18,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:27:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:27:18,806 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 19:27:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:18,836 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-07-12 19:27:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:27:18,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 37 [2022-07-12 19:27:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:18,837 INFO L225 Difference]: With dead ends: 53 [2022-07-12 19:27:18,837 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 19:27:18,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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 19:27:18,838 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:18,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 30 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:18,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 19:27:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-12 19:27:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 52 states have internal predecessors, (54), 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 19:27:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-07-12 19:27:18,840 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 37 [2022-07-12 19:27:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:18,841 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-07-12 19:27:18,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 19:27:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-07-12 19:27:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:27:18,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:18,842 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:18,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:27:18,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:18,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash -708557702, now seen corresponding path program 1 times [2022-07-12 19:27:18,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:18,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077517083] [2022-07-12 19:27:18,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:18,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:18,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:18,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077517083] [2022-07-12 19:27:18,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077517083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:18,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:18,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573999768] [2022-07-12 19:27:18,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:18,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:18,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:18,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:18,874 INFO L87 Difference]: Start difference. First operand 53 states and 54 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 19:27:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:18,883 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-12 19:27:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:18,883 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 38 [2022-07-12 19:27:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:18,884 INFO L225 Difference]: With dead ends: 52 [2022-07-12 19:27:18,884 INFO L226 Difference]: Without dead ends: 52 [2022-07-12 19:27:18,884 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 19:27:18,885 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:18,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-12 19:27:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-12 19:27:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 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 19:27:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-07-12 19:27:18,887 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 38 [2022-07-12 19:27:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:18,887 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-07-12 19:27:18,888 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 19:27:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-07-12 19:27:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:27:18,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:18,888 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:18,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:27:18,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 1 times [2022-07-12 19:27:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:18,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321906556] [2022-07-12 19:27:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:18,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:18,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321906556] [2022-07-12 19:27:18,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321906556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:18,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:18,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267072525] [2022-07-12 19:27:18,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:18,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:18,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:18,926 INFO L87 Difference]: Start difference. First operand 52 states and 53 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 19:27:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:18,940 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-07-12 19:27:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:18,940 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 38 [2022-07-12 19:27:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:18,940 INFO L225 Difference]: With dead ends: 55 [2022-07-12 19:27:18,941 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 19:27:18,941 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 19:27:18,941 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:18,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 19:27:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-07-12 19:27:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 52 states have internal predecessors, (54), 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 19:27:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-07-12 19:27:18,944 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 38 [2022-07-12 19:27:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:18,944 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-07-12 19:27:18,944 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 19:27:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-07-12 19:27:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:27:18,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:18,945 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:18,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 19:27:18,945 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2022-07-12 19:27:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:18,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803370974] [2022-07-12 19:27:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:19,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:19,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803370974] [2022-07-12 19:27:19,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803370974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:19,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657568758] [2022-07-12 19:27:19,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:19,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:19,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:19,032 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 19:27:19,033 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 19:27:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:19,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:27:19,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:19,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:27:19,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:27:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:19,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:21,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657568758] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:21,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:21,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-07-12 19:27:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316800892] [2022-07-12 19:27:21,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:21,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:27:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:21,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:27:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:27:21,884 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:22,061 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-07-12 19:27:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:27:22,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 19:27:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:22,062 INFO L225 Difference]: With dead ends: 85 [2022-07-12 19:27:22,062 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 19:27:22,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:27:22,063 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 137 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:22,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 65 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 86 Invalid, 0 Unknown, 3 Unchecked, 0.1s Time] [2022-07-12 19:27:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 19:27:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2022-07-12 19:27:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 states have internal predecessors, (72), 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 19:27:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-07-12 19:27:22,065 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 42 [2022-07-12 19:27:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:22,065 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-07-12 19:27:22,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-07-12 19:27:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:27:22,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:22,066 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:22,084 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 19:27:22,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:22,267 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2022-07-12 19:27:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:22,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944657116] [2022-07-12 19:27:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:22,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:22,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944657116] [2022-07-12 19:27:22,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944657116] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:22,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248427669] [2022-07-12 19:27:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:22,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:22,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:22,323 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 19:27:22,328 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 19:27:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:22,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 19:27:22,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:22,385 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 19:27:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:22,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:22,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248427669] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:22,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:22,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-07-12 19:27:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151305982] [2022-07-12 19:27:22,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:22,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:27:22,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:22,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:27:22,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:27:22,473 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 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 19:27:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:22,535 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-07-12 19:27:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:27:22,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 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 43 [2022-07-12 19:27:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:22,536 INFO L225 Difference]: With dead ends: 70 [2022-07-12 19:27:22,536 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 19:27:22,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:27:22,537 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:22,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 47 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 19:27:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-07-12 19:27:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 67 states have internal predecessors, (71), 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 19:27:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-07-12 19:27:22,540 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 43 [2022-07-12 19:27:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:22,540 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-07-12 19:27:22,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 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 19:27:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-07-12 19:27:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:27:22,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:22,541 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:22,563 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 19:27:22,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:22,751 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1223382792, now seen corresponding path program 1 times [2022-07-12 19:27:22,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:22,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552153149] [2022-07-12 19:27:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:22,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552153149] [2022-07-12 19:27:22,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552153149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:22,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318188322] [2022-07-12 19:27:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:22,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:22,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:22,807 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 19:27:22,827 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 19:27:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:22,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:27:22,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:22,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:22,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318188322] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:22,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:22,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-12 19:27:22,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881676899] [2022-07-12 19:27:22,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:22,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:27:22,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:22,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:27:22,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:27:22,935 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:22,964 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-07-12 19:27:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:27:22,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-12 19:27:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:22,965 INFO L225 Difference]: With dead ends: 78 [2022-07-12 19:27:22,965 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 19:27:22,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:27:22,965 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:22,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 19:27:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-07-12 19:27:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 75 states have internal predecessors, (79), 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 19:27:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-07-12 19:27:22,969 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 49 [2022-07-12 19:27:22,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:22,969 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-07-12 19:27:22,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-07-12 19:27:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 19:27:22,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:22,970 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:22,989 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 19:27:23,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 19:27:23,190 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:23,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:23,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2022-07-12 19:27:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:23,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200781877] [2022-07-12 19:27:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:23,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:23,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200781877] [2022-07-12 19:27:23,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200781877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:23,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534850942] [2022-07-12 19:27:23,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:27:23,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:23,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:23,343 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 19:27:23,349 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 19:27:23,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:27:23,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:27:23,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 19:27:23,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:23,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:27:23,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:27:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:23,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:26,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534850942] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:26,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:26,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-07-12 19:27:26,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420970388] [2022-07-12 19:27:26,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:26,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 19:27:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:26,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 19:27:26,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:27:26,294 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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 19:27:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:26,787 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-07-12 19:27:26,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:27:26,788 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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 57 [2022-07-12 19:27:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:26,789 INFO L225 Difference]: With dead ends: 134 [2022-07-12 19:27:26,789 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 19:27:26,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 19:27:26,790 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 402 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:26,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 145 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 297 Invalid, 0 Unknown, 3 Unchecked, 0.2s Time] [2022-07-12 19:27:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 19:27:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 97. [2022-07-12 19:27:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 96 states have internal predecessors, (107), 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 19:27:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-07-12 19:27:26,794 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 57 [2022-07-12 19:27:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:26,794 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-07-12 19:27:26,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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 19:27:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-07-12 19:27:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 19:27:26,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:26,795 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:26,812 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 19:27:27,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:27,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2022-07-12 19:27:27,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:27,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123810610] [2022-07-12 19:27:27,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:27,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:27,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123810610] [2022-07-12 19:27:27,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123810610] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:27,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246271382] [2022-07-12 19:27:27,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:27:27,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:27,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:27,135 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 19:27:27,155 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 19:27:27,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 19:27:27,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:27:27,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:27:27,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:27,248 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 19:27:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-07-12 19:27:27,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-07-12 19:27:27,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246271382] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:27,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:27,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-07-12 19:27:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053507724] [2022-07-12 19:27:27,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:27,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 19:27:27,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:27,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 19:27:27,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:27:27,681 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 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 19:27:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:27,926 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-07-12 19:27:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:27:27,927 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 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 58 [2022-07-12 19:27:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:27,928 INFO L225 Difference]: With dead ends: 96 [2022-07-12 19:27:27,928 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 19:27:27,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2022-07-12 19:27:27,929 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 137 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:27,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 87 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:27:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 19:27:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-12 19:27:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 95 states have internal predecessors, (101), 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 19:27:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-07-12 19:27:27,932 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 58 [2022-07-12 19:27:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:27,932 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-07-12 19:27:27,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 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 19:27:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-07-12 19:27:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 19:27:27,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:27,933 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:27,951 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 19:27:28,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:28,148 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:28,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash 579926520, now seen corresponding path program 2 times [2022-07-12 19:27:28,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:28,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448905972] [2022-07-12 19:27:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:28,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:28,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448905972] [2022-07-12 19:27:28,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448905972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:28,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379696181] [2022-07-12 19:27:28,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:27:28,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:28,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:28,205 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 19:27:28,232 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 19:27:28,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:27:28,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:27:28,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:27:28,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:28,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:28,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379696181] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:28,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:28,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-07-12 19:27:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243195587] [2022-07-12 19:27:28,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:28,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 19:27:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 19:27:28,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:27:28,389 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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 19:27:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:28,428 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-07-12 19:27:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:27:28,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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 69 [2022-07-12 19:27:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:28,429 INFO L225 Difference]: With dead ends: 96 [2022-07-12 19:27:28,429 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 19:27:28,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:27:28,429 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:28,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 65 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 19:27:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-12 19:27:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 95 states have internal predecessors, (97), 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 19:27:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-07-12 19:27:28,432 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 69 [2022-07-12 19:27:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:28,432 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-07-12 19:27:28,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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 19:27:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-07-12 19:27:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 19:27:28,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:28,433 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:28,450 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 19:27:28,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 19:27:28,647 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:28,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash -713446614, now seen corresponding path program 3 times [2022-07-12 19:27:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:28,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304364733] [2022-07-12 19:27:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:28,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 19:27:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:28,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304364733] [2022-07-12 19:27:28,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304364733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:28,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116392568] [2022-07-12 19:27:28,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 19:27:28,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:28,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:28,750 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 19:27:28,781 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 19:27:28,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 19:27:28,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:27:28,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 19:27:28,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:29,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:27:29,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:27:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-07-12 19:27:29,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:27:29,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116392568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:29,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:27:29,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2022-07-12 19:27:29,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223905768] [2022-07-12 19:27:29,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:29,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:27:29,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:29,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:27:29,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:27:29,288 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:29,381 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-07-12 19:27:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:27:29,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-07-12 19:27:29,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:29,382 INFO L225 Difference]: With dead ends: 95 [2022-07-12 19:27:29,382 INFO L226 Difference]: Without dead ends: 95 [2022-07-12 19:27:29,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-07-12 19:27:29,382 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:27:29,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 32 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:27:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-12 19:27:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-07-12 19:27:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 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 19:27:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2022-07-12 19:27:29,384 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 87 [2022-07-12 19:27:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:29,384 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2022-07-12 19:27:29,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:27:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-07-12 19:27:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 19:27:29,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:29,385 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:29,405 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 19:27:29,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 19:27:29,595 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 19:27:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1572522744, now seen corresponding path program 3 times [2022-07-12 19:27:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:29,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333878416] [2022-07-12 19:27:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:27:29,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 19:27:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:27:29,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 19:27:29,699 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 19:27:29,699 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2022-07-12 19:27:29,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2022-07-12 19:27:29,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2022-07-12 19:27:29,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2022-07-12 19:27:29,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2022-07-12 19:27:29,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2022-07-12 19:27:29,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2022-07-12 19:27:29,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2022-07-12 19:27:29,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2022-07-12 19:27:29,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:27:29,703 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:29,706 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 19:27:29,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:27:29 BoogieIcfgContainer [2022-07-12 19:27:29,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 19:27:29,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 19:27:29,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 19:27:29,739 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 19:27:29,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:27:16" (3/4) ... [2022-07-12 19:27:29,740 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 19:27:29,772 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 19:27:29,773 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 19:27:29,773 INFO L158 Benchmark]: Toolchain (without parser) took 13462.35ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 64.4MB in the beginning and 79.0MB in the end (delta: -14.6MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-12 19:27:29,773 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory was 53.5MB in the beginning and 53.5MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:27:29,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.67ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 73.6MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 19:27:29,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.04ms. Allocated memory is still 98.6MB. Free memory was 73.6MB in the beginning and 72.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:27:29,773 INFO L158 Benchmark]: Boogie Preprocessor took 36.76ms. Allocated memory is still 98.6MB. Free memory was 71.8MB in the beginning and 70.9MB in the end (delta: 889.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:27:29,774 INFO L158 Benchmark]: RCFGBuilder took 253.51ms. Allocated memory is still 98.6MB. Free memory was 70.6MB in the beginning and 60.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 19:27:29,774 INFO L158 Benchmark]: TraceAbstraction took 12895.99ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 59.5MB in the beginning and 84.2MB in the end (delta: -24.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2022-07-12 19:27:29,774 INFO L158 Benchmark]: Witness Printer took 33.58ms. Allocated memory is still 119.5MB. Free memory was 84.2MB in the beginning and 79.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 19:27:29,775 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory was 53.5MB in the beginning and 53.5MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.67ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 73.6MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.04ms. Allocated memory is still 98.6MB. Free memory was 73.6MB in the beginning and 72.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.76ms. Allocated memory is still 98.6MB. Free memory was 71.8MB in the beginning and 70.9MB in the end (delta: 889.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 253.51ms. Allocated memory is still 98.6MB. Free memory was 70.6MB in the beginning and 60.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12895.99ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 59.5MB in the beginning and 84.2MB in the end (delta: -24.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 33.58ms. Allocated memory is still 119.5MB. Free memory was 84.2MB in the beginning and 79.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] int array[10]; VAL [array={1:0}] [L25] CALL, EXPR getNumbers2() [L13] CALL, EXPR getNumbers() [L5] int i = 0; VAL [array={1:0}, i=0] [L5] COND TRUE i < 10 VAL [array={1:0}, i=0] [L6] array[i] = i VAL [array={1:0}, i=0] [L5] ++i VAL [array={1:0}, i=1] [L5] COND TRUE i < 10 VAL [array={1:0}, i=1] [L6] array[i] = i VAL [array={1:0}, i=1] [L5] ++i VAL [array={1:0}, i=2] [L5] COND TRUE i < 10 VAL [array={1:0}, i=2] [L6] array[i] = i VAL [array={1:0}, i=2] [L5] ++i VAL [array={1:0}, i=3] [L5] COND TRUE i < 10 VAL [array={1:0}, i=3] [L6] array[i] = i VAL [array={1:0}, i=3] [L5] ++i VAL [array={1:0}, i=4] [L5] COND TRUE i < 10 VAL [array={1:0}, i=4] [L6] array[i] = i VAL [array={1:0}, i=4] [L5] ++i VAL [array={1:0}, i=5] [L5] COND TRUE i < 10 VAL [array={1:0}, i=5] [L6] array[i] = i VAL [array={1:0}, i=5] [L5] ++i VAL [array={1:0}, i=6] [L5] COND TRUE i < 10 VAL [array={1:0}, i=6] [L6] array[i] = i VAL [array={1:0}, i=6] [L5] ++i VAL [array={1:0}, i=7] [L5] COND TRUE i < 10 VAL [array={1:0}, i=7] [L6] array[i] = i VAL [array={1:0}, i=7] [L5] ++i VAL [array={1:0}, i=8] [L5] COND TRUE i < 10 VAL [array={1:0}, i=8] [L6] array[i] = i VAL [array={1:0}, i=8] [L5] ++i VAL [array={1:0}, i=9] [L5] COND TRUE i < 10 VAL [array={1:0}, i=9] [L6] array[i] = i VAL [array={1:0}, i=9] [L5] ++i VAL [array={1:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={1:0}, i=10] [L9] return array; VAL [\result={1:0}, array={1:0}, i=10] [L13] RET, EXPR getNumbers() [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}, numbers[i]=0] [L17] ++i VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}, numbers[i]=1] [L17] ++i VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}, numbers[i]=2] [L17] ++i VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}, numbers[i]=3] [L17] ++i VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}, numbers[i]=4] [L17] ++i VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}, numbers[i]=5] [L17] ++i VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}, numbers[i]=6] [L17] ++i VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}, numbers[i]=7] [L17] ++i VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}, numbers[i]=8] [L17] ++i VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}, numbers[i]=9] [L17] ++i VAL [array={1:0}, i=10, numbers={1:0}, numbers2={10:0}] [L17] COND FALSE !(i < 10) VAL [array={1:0}, i=10, numbers={1:0}, numbers2={10:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={10:0}, array={1:0}, i=10, numbers={1:0}] [L25] RET, EXPR getNumbers2() [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 16, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1068 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1068 mSDsluCounter, 756 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6 IncrementalHoareTripleChecker+Unchecked, 514 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 968 IncrementalHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 242 mSDtfsCounter, 968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 873 GetRequests, 710 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=12, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 69 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1109 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1332 ConstructedInterpolants, 68 QuantifiedInterpolants, 10948 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1320 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 3996/4561 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-12 19:27:29,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)