./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f737570030041640fd86c7d2770b30b4e6ee4ac0d1c521887700aab87fb1426 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:21:53,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:21:53,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:21:53,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:21:53,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:21:53,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:21:53,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:21:53,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:21:53,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:21:53,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:21:53,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:21:53,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:21:53,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:21:53,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:21:53,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:21:53,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:21:53,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:21:53,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:21:53,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:21:53,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:21:53,592 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:21:53,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:21:53,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:21:53,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:21:53,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:21:53,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:21:53,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:21:53,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:21:53,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:21:53,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:21:53,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:21:53,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:21:53,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:21:53,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:21:53,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:21:53,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:21:53,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:21:53,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:21:53,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:21:53,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:21:53,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:21:53,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:21:53,612 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:21:53,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:21:53,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:21:53,637 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:21:53,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:21:53,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:21:53,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:21:53,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:21:53,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:21:53,639 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:21:53,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:21:53,640 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:21:53,640 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:21:53,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:21:53,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:21:53,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:21:53,640 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:21:53,640 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:21:53,641 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:21:53,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:21:53,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:21:53,641 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:21:53,641 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:21:53,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:21:53,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:21:53,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:21:53,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:21:53,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:21:53,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:21:53,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:21:53,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:21:53,643 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 -> 2f737570030041640fd86c7d2770b30b4e6ee4ac0d1c521887700aab87fb1426 [2022-07-12 19:21:53,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:21:53,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:21:53,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:21:53,860 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:21:53,861 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:21:53,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2022-07-12 19:21:53,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63571d42a/38fd30bfe70b48bb9ff4a327af406092/FLAG8a8c67e9c [2022-07-12 19:21:54,330 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:21:54,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2022-07-12 19:21:54,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63571d42a/38fd30bfe70b48bb9ff4a327af406092/FLAG8a8c67e9c [2022-07-12 19:21:54,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63571d42a/38fd30bfe70b48bb9ff4a327af406092 [2022-07-12 19:21:54,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:21:54,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:21:54,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:21:54,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:21:54,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:21:54,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:21:54" (1/1) ... [2022-07-12 19:21:54,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371d2eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54, skipping insertion in model container [2022-07-12 19:21:54,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:21:54" (1/1) ... [2022-07-12 19:21:54,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:21:54,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:21:54,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:21:54,646 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:21:54,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:21:54,707 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:21:54,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54 WrapperNode [2022-07-12 19:21:54,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:21:54,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:21:54,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:21:54,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:21:54,715 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:21:54" (1/1) ... [2022-07-12 19:21:54,724 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:21:54" (1/1) ... [2022-07-12 19:21:54,741 INFO L137 Inliner]: procedures = 116, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2022-07-12 19:21:54,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:21:54,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:21:54,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:21:54,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:21:54,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54" (1/1) ... [2022-07-12 19:21:54,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54" (1/1) ... [2022-07-12 19:21:54,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54" (1/1) ... [2022-07-12 19:21:54,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54" (1/1) ... [2022-07-12 19:21:54,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54" (1/1) ... [2022-07-12 19:21:54,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54" (1/1) ... [2022-07-12 19:21:54,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54" (1/1) ... [2022-07-12 19:21:54,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:21:54,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:21:54,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:21:54,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:21:54,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54" (1/1) ... [2022-07-12 19:21:54,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:21:54,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:54,795 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:21:54,797 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:21:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-12 19:21:54,822 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-12 19:21:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:21:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:21:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:21:54,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:21:54,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:21:54,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:21:54,896 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:21:54,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:21:54,933 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-12 19:21:55,182 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:21:55,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:21:55,188 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 19:21:55,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:21:55 BoogieIcfgContainer [2022-07-12 19:21:55,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:21:55,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:21:55,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:21:55,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:21:55,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:21:54" (1/3) ... [2022-07-12 19:21:55,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59523840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:21:55, skipping insertion in model container [2022-07-12 19:21:55,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:21:54" (2/3) ... [2022-07-12 19:21:55,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59523840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:21:55, skipping insertion in model container [2022-07-12 19:21:55,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:21:55" (3/3) ... [2022-07-12 19:21:55,197 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2022-07-12 19:21:55,207 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:21:55,208 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2022-07-12 19:21:55,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:21:55,260 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@3f5a5952, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48236ae9 [2022-07-12 19:21:55,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2022-07-12 19:21:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 131 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 19:21:55,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:55,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 19:21:55,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:21:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-07-12 19:21:55,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:55,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732293756] [2022-07-12 19:21:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:55,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:55,427 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:21:55,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:55,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732293756] [2022-07-12 19:21:55,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732293756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:55,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:55,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:21:55,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800318128] [2022-07-12 19:21:55,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:55,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:21:55,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:55,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:21:55,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:21:55,460 INFO L87 Difference]: Start difference. First operand has 133 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 131 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 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), 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:21:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:55,563 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-07-12 19:21:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:21:55,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) 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:21:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:55,571 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:21:55,572 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:21:55,574 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:21:55,577 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 50 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:55,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 165 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:21:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:21:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-12 19:21:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 123 states have internal predecessors, (129), 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:21:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-07-12 19:21:55,614 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 4 [2022-07-12 19:21:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:55,615 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-07-12 19:21:55,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) 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:21:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-07-12 19:21:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 19:21:55,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:55,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 19:21:55,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:21:55,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:21:55,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-07-12 19:21:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:55,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436888959] [2022-07-12 19:21:55,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:55,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:55,671 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:21:55,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:55,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436888959] [2022-07-12 19:21:55,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436888959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:55,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:55,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:21:55,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885581586] [2022-07-12 19:21:55,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:55,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:21:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:55,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:21:55,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:21:55,676 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 3 states, 2 states have (on average 2.0) 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:21:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:55,710 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-12 19:21:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:21:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) 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:21:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:55,711 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:21:55,711 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:21:55,712 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:21:55,713 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 122 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:55,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 111 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:21:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 19:21:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 120 states have internal predecessors, (126), 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:21:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-12 19:21:55,723 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 4 [2022-07-12 19:21:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:55,724 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-12 19:21:55,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) 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:21:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-12 19:21:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:21:55,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:55,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:55,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:21:55,725 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:21:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2022-07-12 19:21:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:55,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323501425] [2022-07-12 19:21:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:55,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:55,761 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:21:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:55,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323501425] [2022-07-12 19:21:55,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323501425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:55,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:55,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:21:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054500893] [2022-07-12 19:21:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:55,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:21:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:55,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:21:55,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:21:55,764 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:55,775 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-07-12 19:21:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:21:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:21:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:55,776 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:21:55,776 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 19:21:55,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:21:55,777 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:55,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 242 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 19:21:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2022-07-12 19:21:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 121 states have internal predecessors, (127), 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:21:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2022-07-12 19:21:55,782 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 9 [2022-07-12 19:21:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:55,783 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2022-07-12 19:21:55,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-07-12 19:21:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:21:55,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:55,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:55,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:21:55,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:21:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-07-12 19:21:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:55,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175917092] [2022-07-12 19:21:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:55,810 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:21:55,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:55,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175917092] [2022-07-12 19:21:55,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175917092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:55,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:55,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:21:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141081627] [2022-07-12 19:21:55,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:55,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:21:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:55,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:21:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:21:55,812 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:55,852 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-12 19:21:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:21:55,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:21:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:55,853 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:21:55,853 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:21:55,854 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:21:55,854 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:55,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 159 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:21:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 19:21:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.826086956521739) internal successors, (126), 120 states have internal predecessors, (126), 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:21:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-12 19:21:55,859 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 9 [2022-07-12 19:21:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:55,859 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-12 19:21:55,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-12 19:21:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:21:55,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:55,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:55,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:21:55,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:21:55,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:55,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-07-12 19:21:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:55,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587204876] [2022-07-12 19:21:55,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:55,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587204876] [2022-07-12 19:21:55,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587204876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:55,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:55,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:21:55,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453697243] [2022-07-12 19:21:55,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:55,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:21:55,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:55,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:21:55,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:21:55,890 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:55,906 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-07-12 19:21:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:21:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:21:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:55,908 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:21:55,908 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:21:55,908 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:21:55,909 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 116 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:55,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 115 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:21:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 19:21:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 119 states have internal predecessors, (125), 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:21:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-07-12 19:21:55,913 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 9 [2022-07-12 19:21:55,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:55,913 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-07-12 19:21:55,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-07-12 19:21:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 19:21:55,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:55,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:55,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:21:55,914 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:21:55,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:55,915 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2022-07-12 19:21:55,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:55,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67399372] [2022-07-12 19:21:55,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:55,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:55,986 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:21:55,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:55,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67399372] [2022-07-12 19:21:55,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67399372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:55,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:55,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:21:55,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919250567] [2022-07-12 19:21:55,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:55,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:21:55,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:55,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:21:55,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:21:55,989 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:56,084 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-12 19:21:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:21:56,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 19:21:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:56,086 INFO L225 Difference]: With dead ends: 124 [2022-07-12 19:21:56,086 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:21:56,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:21:56,088 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:56,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 255 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:21:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:21:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-12 19:21:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 122 states have internal predecessors, (129), 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:21:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2022-07-12 19:21:56,107 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 10 [2022-07-12 19:21:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:56,107 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2022-07-12 19:21:56,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2022-07-12 19:21:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 19:21:56,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:56,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:56,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:21:56,108 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:21:56,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2022-07-12 19:21:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:56,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280578152] [2022-07-12 19:21:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:56,225 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:21:56,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280578152] [2022-07-12 19:21:56,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280578152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:21:56,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:21:56,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:21:56,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354984861] [2022-07-12 19:21:56,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:21:56,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:21:56,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:56,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:21:56,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:21:56,227 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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:21:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:56,311 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-12 19:21:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:21:56,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 19:21:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:56,313 INFO L225 Difference]: With dead ends: 124 [2022-07-12 19:21:56,313 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:21:56,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:21:56,313 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 170 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:56,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 319 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:21:56,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:21:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-12 19:21:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7777777777777777) internal successors, (128), 122 states have internal predecessors, (128), 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:21:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2022-07-12 19:21:56,317 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 10 [2022-07-12 19:21:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:56,317 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2022-07-12 19:21:56,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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:21:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2022-07-12 19:21:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 19:21:56,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:56,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:56,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:21:56,318 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:21:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2022-07-12 19:21:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:56,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253813301] [2022-07-12 19:21:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:56,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:56,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:56,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253813301] [2022-07-12 19:21:56,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253813301] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:56,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950208908] [2022-07-12 19:21:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:56,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:56,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:56,347 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:21:56,352 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:21:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:56,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:21:56,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:56,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:56,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950208908] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:56,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:56,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-12 19:21:56,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72658823] [2022-07-12 19:21:56,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:56,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:21:56,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:56,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:21:56,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:21:56,479 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:21:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:56,489 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-07-12 19:21:56,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:21:56,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 19:21:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:56,490 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:21:56,490 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:21:56,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:21:56,491 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 14 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:56,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 465 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:21:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:21:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-12 19:21:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 124 states have internal predecessors, (130), 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:21:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2022-07-12 19:21:56,514 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 14 [2022-07-12 19:21:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:56,514 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2022-07-12 19:21:56,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:21:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-07-12 19:21:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:21:56,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:56,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:56,534 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:21:56,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:56,734 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:21:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2022-07-12 19:21:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:56,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502906488] [2022-07-12 19:21:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:56,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:56,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502906488] [2022-07-12 19:21:56,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502906488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:56,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665176057] [2022-07-12 19:21:56,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:56,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:56,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:56,789 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:21:56,790 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:21:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:56,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 19:21:56,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:56,881 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:21:56,919 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:21:56,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 19:21:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:56,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:21:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:57,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665176057] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:21:57,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:21:57,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-12 19:21:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641777187] [2022-07-12 19:21:57,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:21:57,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:21:57,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:21:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:21:57,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:21:57,003 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:21:57,059 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2022-07-12 19:21:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:21:57,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 19:21:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:21:57,060 INFO L225 Difference]: With dead ends: 123 [2022-07-12 19:21:57,060 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 19:21:57,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:21:57,061 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 141 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:21:57,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 313 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 66 Unchecked, 0.0s Time] [2022-07-12 19:21:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 19:21:57,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-12 19:21:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 122 states have internal predecessors, (128), 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:21:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2022-07-12 19:21:57,064 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 15 [2022-07-12 19:21:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:21:57,064 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2022-07-12 19:21:57,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:21:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2022-07-12 19:21:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:21:57,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:21:57,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:21:57,083 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:21:57,279 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,SelfDestructingSolverStorable8 [2022-07-12 19:21:57,280 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:21:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:21:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2022-07-12 19:21:57,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:21:57,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217954892] [2022-07-12 19:21:57,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:21:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:57,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:21:57,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217954892] [2022-07-12 19:21:57,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217954892] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:21:57,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198663322] [2022-07-12 19:21:57,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:21:57,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:21:57,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:21:57,371 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:21:57,372 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:21:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:21:57,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:21:57,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:21:57,430 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:21:57,434 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:21:57,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:21:57,496 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:21:57,501 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:21:57,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:21:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:21:57,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:01,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198663322] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:01,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:01,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-07-12 19:22:01,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297785690] [2022-07-12 19:22:01,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:01,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 19:22:01,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:01,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 19:22:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:22:01,797 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:01,986 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-12 19:22:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:22:01,986 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 19:22:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:01,987 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:22:01,987 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:22:01,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:22:01,988 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 356 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:01,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 406 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 177 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2022-07-12 19:22:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:22:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 19:22:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 1.7027027027027026) internal successors, (126), 120 states have internal predecessors, (126), 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:22:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-12 19:22:01,991 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 15 [2022-07-12 19:22:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:01,991 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-12 19:22:01,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-12 19:22:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:22:01,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:01,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:02,011 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:22:02,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:02,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2022-07-12 19:22:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:02,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402966002] [2022-07-12 19:22:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:22:02,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:02,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402966002] [2022-07-12 19:22:02,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402966002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:02,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:02,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:22:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824459331] [2022-07-12 19:22:02,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:02,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:22:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:02,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:22:02,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:22:02,253 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:02,355 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2022-07-12 19:22:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:22:02,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:22:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:02,356 INFO L225 Difference]: With dead ends: 118 [2022-07-12 19:22:02,356 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 19:22:02,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:22:02,357 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 107 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:02,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 303 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 19:22:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-12 19:22:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 74 states have (on average 1.662162162162162) internal successors, (123), 117 states have internal predecessors, (123), 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:22:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2022-07-12 19:22:02,359 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 22 [2022-07-12 19:22:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:02,360 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2022-07-12 19:22:02,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2022-07-12 19:22:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:22:02,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:02,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:02,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:22:02,361 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2022-07-12 19:22:02,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:02,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683389841] [2022-07-12 19:22:02,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:02,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683389841] [2022-07-12 19:22:02,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683389841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:02,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:02,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:22:02,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578056069] [2022-07-12 19:22:02,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:02,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:22:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:02,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:22:02,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:22:02,416 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:02,502 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-07-12 19:22:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:22:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:22:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:02,503 INFO L225 Difference]: With dead ends: 111 [2022-07-12 19:22:02,503 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 19:22:02,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:22:02,504 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 388 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:02,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 89 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 19:22:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-12 19:22:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 110 states have internal predecessors, (116), 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:22:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2022-07-12 19:22:02,507 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 22 [2022-07-12 19:22:02,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:02,507 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2022-07-12 19:22:02,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2022-07-12 19:22:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:22:02,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:02,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:02,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:22:02,508 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2022-07-12 19:22:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:02,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339905814] [2022-07-12 19:22:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:02,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:02,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339905814] [2022-07-12 19:22:02,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339905814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:02,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:02,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:22:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406615233] [2022-07-12 19:22:02,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:02,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:22:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:22:02,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:22:02,568 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:22:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:02,645 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-07-12 19:22:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:22:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:22:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:02,646 INFO L225 Difference]: With dead ends: 106 [2022-07-12 19:22:02,646 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 19:22:02,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:22:02,647 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 362 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:02,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 80 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 19:22:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-12 19:22:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.5) internal successors, (111), 105 states have internal predecessors, (111), 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:22:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2022-07-12 19:22:02,649 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 28 [2022-07-12 19:22:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:02,649 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2022-07-12 19:22:02,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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:22:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-07-12 19:22:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:22:02,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:02,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:02,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 19:22:02,650 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2022-07-12 19:22:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:02,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146824625] [2022-07-12 19:22:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:02,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:02,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146824625] [2022-07-12 19:22:02,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146824625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:02,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:02,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:22:02,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288584822] [2022-07-12 19:22:02,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:02,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:22:02,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:02,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:22:02,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:22:02,766 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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:22:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:02,911 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-07-12 19:22:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:22:02,912 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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) Word has length 28 [2022-07-12 19:22:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:02,912 INFO L225 Difference]: With dead ends: 101 [2022-07-12 19:22:02,912 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 19:22:02,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:22:02,913 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 514 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:02,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 149 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 19:22:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-12 19:22:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 100 states have internal predecessors, (106), 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:22:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-07-12 19:22:02,915 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 28 [2022-07-12 19:22:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:02,915 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-07-12 19:22:02,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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:22:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-07-12 19:22:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:22:02,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:02,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:02,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 19:22:02,916 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:02,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:02,916 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2022-07-12 19:22:02,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:02,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545626418] [2022-07-12 19:22:02,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:02,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:03,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:03,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545626418] [2022-07-12 19:22:03,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545626418] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:03,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155008607] [2022-07-12 19:22:03,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:03,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:03,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:03,085 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:22:03,087 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:22:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:03,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 19:22:03,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:03,197 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:22:03,284 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 19:22:03,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:22:03,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:03,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:22:03,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:22:03,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:03,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:22:03,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:03,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 19:22:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:03,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:03,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2022-07-12 19:22:03,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-12 19:22:03,564 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-12 19:22:03,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:03,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-12 19:22:03,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-07-12 19:22:03,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-07-12 19:22:03,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-12 19:22:03,783 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:22:03,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-12 19:22:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 19:22:03,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155008607] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:03,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:03,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 35 [2022-07-12 19:22:03,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422410471] [2022-07-12 19:22:03,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:03,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 19:22:03,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:03,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 19:22:03,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=952, Unknown=3, NotChecked=192, Total=1260 [2022-07-12 19:22:03,791 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 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:22:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:04,350 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2022-07-12 19:22:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:22:04,350 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 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 28 [2022-07-12 19:22:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:04,351 INFO L225 Difference]: With dead ends: 193 [2022-07-12 19:22:04,351 INFO L226 Difference]: Without dead ends: 193 [2022-07-12 19:22:04,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=1573, Unknown=3, NotChecked=252, Total=2070 [2022-07-12 19:22:04,352 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 873 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 623 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:04,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 1335 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 659 Invalid, 0 Unknown, 623 Unchecked, 0.3s Time] [2022-07-12 19:22:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-12 19:22:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2022-07-12 19:22:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 133 states have internal predecessors, (149), 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:22:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2022-07-12 19:22:04,355 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 28 [2022-07-12 19:22:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:04,355 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2022-07-12 19:22:04,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 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:22:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2022-07-12 19:22:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:22:04,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:04,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:04,375 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:22:04,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 19:22:04,567 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:04,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2022-07-12 19:22:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:04,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086116135] [2022-07-12 19:22:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:04,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:04,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:04,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086116135] [2022-07-12 19:22:04,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086116135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:04,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:04,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:22:04,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436414523] [2022-07-12 19:22:04,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:04,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:22:04,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:22:04,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:22:04,685 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:04,884 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2022-07-12 19:22:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:22:04,885 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 19:22:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:04,885 INFO L225 Difference]: With dead ends: 129 [2022-07-12 19:22:04,885 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 19:22:04,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:22:04,886 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 565 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:04,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 77 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 19:22:04,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-12 19:22:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 128 states have internal predecessors, (142), 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:22:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2022-07-12 19:22:04,888 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 29 [2022-07-12 19:22:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:04,888 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2022-07-12 19:22:04,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2022-07-12 19:22:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:22:04,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:04,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:04,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:22:04,889 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:04,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2022-07-12 19:22:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:04,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009155439] [2022-07-12 19:22:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:05,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009155439] [2022-07-12 19:22:05,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009155439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:05,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519907446] [2022-07-12 19:22:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:05,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:05,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:05,081 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:22:05,082 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:22:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:05,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-12 19:22:05,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:05,172 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:22:05,203 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 19:22:05,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:22:05,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:05,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:22:05,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-07-12 19:22:05,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:05,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2022-07-12 19:22:05,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-07-12 19:22:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:05,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:05,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:22:05,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:22:05,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:22:05,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:05,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 19:22:05,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2022-07-12 19:22:05,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-07-12 19:22:05,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-07-12 19:22:05,722 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-07-12 19:22:05,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 55 [2022-07-12 19:22:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 19:22:05,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519907446] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:05,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:05,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-07-12 19:22:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077788980] [2022-07-12 19:22:05,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:05,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 19:22:05,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:05,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 19:22:05,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=581, Unknown=3, NotChecked=150, Total=812 [2022-07-12 19:22:05,766 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 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:22:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:06,387 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2022-07-12 19:22:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:22:06,387 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 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 29 [2022-07-12 19:22:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:06,388 INFO L225 Difference]: With dead ends: 175 [2022-07-12 19:22:06,388 INFO L226 Difference]: Without dead ends: 175 [2022-07-12 19:22:06,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=870, Unknown=3, NotChecked=186, Total=1190 [2022-07-12 19:22:06,389 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 389 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 597 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:06,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 687 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 744 Invalid, 0 Unknown, 597 Unchecked, 0.4s Time] [2022-07-12 19:22:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-12 19:22:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2022-07-12 19:22:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 132 states have internal predecessors, (146), 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:22:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2022-07-12 19:22:06,391 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 29 [2022-07-12 19:22:06,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:06,392 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2022-07-12 19:22:06,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 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:22:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2022-07-12 19:22:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:22:06,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:06,392 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:06,411 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:22:06,592 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,SelfDestructingSolverStorable16 [2022-07-12 19:22:06,593 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:06,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:06,593 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2022-07-12 19:22:06,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:06,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070930275] [2022-07-12 19:22:06,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:06,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:06,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:06,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070930275] [2022-07-12 19:22:06,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070930275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:06,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:06,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:22:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112277233] [2022-07-12 19:22:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:06,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:22:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:06,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:22:06,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:22:06,708 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:06,942 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-07-12 19:22:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:22:06,943 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 19:22:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:06,943 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:22:06,943 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:22:06,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:22:06,944 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 227 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:06,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 314 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:22:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-12 19:22:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 131 states have internal predecessors, (144), 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:22:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-07-12 19:22:06,946 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 30 [2022-07-12 19:22:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:06,946 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-07-12 19:22:06,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-07-12 19:22:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:22:06,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:06,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:06,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 19:22:06,948 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:06,948 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2022-07-12 19:22:06,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:06,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444921597] [2022-07-12 19:22:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:06,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:07,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:07,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444921597] [2022-07-12 19:22:07,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444921597] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:07,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774345449] [2022-07-12 19:22:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:07,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:07,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:07,079 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:22:07,080 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:22:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:07,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 19:22:07,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:07,161 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:22:07,179 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:07,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:22:07,197 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 19:22:07,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:22:07,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:07,220 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:07,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 19:22:07,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-12 19:22:07,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:07,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-12 19:22:07,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:07,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2022-07-12 19:22:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:07,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:07,492 INFO L356 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2022-07-12 19:22:07,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2022-07-12 19:22:07,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_709) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) is different from false [2022-07-12 19:22:07,504 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:07,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2022-07-12 19:22:07,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 215 [2022-07-12 19:22:07,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 187 [2022-07-12 19:22:07,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 171 [2022-07-12 19:22:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 19:22:07,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774345449] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:07,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:07,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 28 [2022-07-12 19:22:07,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882517703] [2022-07-12 19:22:07,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:07,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 19:22:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:07,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 19:22:07,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=673, Unknown=2, NotChecked=52, Total=812 [2022-07-12 19:22:07,706 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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:22:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:08,276 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2022-07-12 19:22:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:22:08,277 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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 30 [2022-07-12 19:22:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:08,278 INFO L225 Difference]: With dead ends: 131 [2022-07-12 19:22:08,278 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 19:22:08,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=1395, Unknown=2, NotChecked=78, Total=1722 [2022-07-12 19:22:08,279 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 157 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:08,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 717 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 508 Invalid, 0 Unknown, 182 Unchecked, 0.2s Time] [2022-07-12 19:22:08,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 19:22:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-12 19:22:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.2882882882882882) internal successors, (143), 130 states have internal predecessors, (143), 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:22:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2022-07-12 19:22:08,282 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 30 [2022-07-12 19:22:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:08,283 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2022-07-12 19:22:08,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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:22:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2022-07-12 19:22:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:22:08,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:08,285 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:08,302 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:22:08,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:08,492 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:08,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2022-07-12 19:22:08,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:08,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843856371] [2022-07-12 19:22:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:08,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:08,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843856371] [2022-07-12 19:22:08,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843856371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:08,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267751770] [2022-07-12 19:22:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:08,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:08,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:08,676 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:22:08,677 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:22:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:08,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 19:22:08,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:08,788 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:22:08,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:22:08,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:08,899 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:08,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-07-12 19:22:09,036 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:22:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:09,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:09,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-07-12 19:22:09,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-12 19:22:09,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-12 19:22:09,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:09,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 19:22:09,241 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:22:09,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-12 19:22:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:09,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267751770] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:09,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:09,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2022-07-12 19:22:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867792458] [2022-07-12 19:22:09,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:09,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 19:22:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 19:22:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2022-07-12 19:22:09,247 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 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:22:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:09,754 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-07-12 19:22:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:22:09,755 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 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 33 [2022-07-12 19:22:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:09,756 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:22:09,756 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 19:22:09,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1358, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 19:22:09,757 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 325 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:09,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 653 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 712 Invalid, 0 Unknown, 57 Unchecked, 0.3s Time] [2022-07-12 19:22:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 19:22:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-12 19:22:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 129 states have internal predecessors, (141), 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:22:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2022-07-12 19:22:09,759 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 33 [2022-07-12 19:22:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:09,760 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2022-07-12 19:22:09,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 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:22:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2022-07-12 19:22:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:22:09,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:09,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:09,783 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:22:09,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:09,975 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2022-07-12 19:22:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:09,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577470003] [2022-07-12 19:22:09,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:10,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:10,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577470003] [2022-07-12 19:22:10,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577470003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:10,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99440808] [2022-07-12 19:22:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:10,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:10,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:10,179 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:22:10,180 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:22:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:10,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 19:22:10,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:10,273 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:22:10,296 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:10,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:22:10,353 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 19:22:10,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:22:10,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:10,381 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:10,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 19:22:10,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-12 19:22:10,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:10,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-12 19:22:10,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:10,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-12 19:22:10,606 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:22:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:10,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:12,782 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_881) 0)) 1)) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2022-07-12 19:22:12,797 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|))))) is different from false [2022-07-12 19:22:12,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:12,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2022-07-12 19:22:12,845 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int) (v_ArrVal_880 (Array Int Int))) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))))) (and .cse0 (or .cse0 (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ v_prenex_3 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ v_prenex_3 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_3)))))) is different from false [2022-07-12 19:22:12,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:12,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-12 19:22:12,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2022-07-12 19:22:12,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 202 [2022-07-12 19:22:12,868 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:12,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 237 [2022-07-12 19:22:12,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 246 [2022-07-12 19:22:12,911 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:22:12,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-07-12 19:22:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 19:22:12,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99440808] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:12,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:12,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2022-07-12 19:22:12,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431144289] [2022-07-12 19:22:12,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:12,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 19:22:12,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:12,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 19:22:12,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=793, Unknown=3, NotChecked=174, Total=1056 [2022-07-12 19:22:12,936 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 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:22:13,404 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int) (v_ArrVal_880 (Array Int Int))) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|))))) (.cse1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (or .cse2 (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ v_prenex_3 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ v_prenex_3 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_3)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= .cse1 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-12 19:22:14,116 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-12 19:22:14,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int) (v_ArrVal_880 (Array Int Int))) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|))))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse2 (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (or .cse2 (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ v_prenex_3 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= (select |c_#valid| .cse1) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ v_prenex_3 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_3)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-12 19:22:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:14,998 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-07-12 19:22:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:22:14,999 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 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 33 [2022-07-12 19:22:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:15,006 INFO L225 Difference]: With dead ends: 129 [2022-07-12 19:22:15,006 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 19:22:15,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=210, Invalid=1368, Unknown=6, NotChecked=486, Total=2070 [2022-07-12 19:22:15,014 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 211 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:15,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 948 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 705 Invalid, 0 Unknown, 282 Unchecked, 0.3s Time] [2022-07-12 19:22:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 19:22:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-12 19:22:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 128 states have internal predecessors, (140), 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:22:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2022-07-12 19:22:15,019 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 33 [2022-07-12 19:22:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:15,019 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2022-07-12 19:22:15,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 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:22:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-07-12 19:22:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:22:15,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:15,020 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:15,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 19:22:15,227 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,SelfDestructingSolverStorable20 [2022-07-12 19:22:15,228 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash -726129858, now seen corresponding path program 2 times [2022-07-12 19:22:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201158591] [2022-07-12 19:22:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:15,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:15,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201158591] [2022-07-12 19:22:15,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201158591] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:15,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013619851] [2022-07-12 19:22:15,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:22:15,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:15,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:15,257 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:22:15,258 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:22:15,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:22:15,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:22:15,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:22:15,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:15,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:15,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013619851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:15,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:22:15,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-12 19:22:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613798412] [2022-07-12 19:22:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:15,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:22:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:22:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:22:15,370 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:15,377 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-07-12 19:22:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:22:15,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:22:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:15,378 INFO L225 Difference]: With dead ends: 84 [2022-07-12 19:22:15,378 INFO L226 Difference]: Without dead ends: 84 [2022-07-12 19:22:15,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:22:15,379 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:15,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 102 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:22:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-12 19:22:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-12 19:22:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 83 states have internal predecessors, (88), 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:22:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-07-12 19:22:15,381 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 33 [2022-07-12 19:22:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:15,381 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-07-12 19:22:15,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-07-12 19:22:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:22:15,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:15,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:15,402 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:22:15,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:15,592 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2022-07-12 19:22:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:15,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922128673] [2022-07-12 19:22:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:15,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:15,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:15,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922128673] [2022-07-12 19:22:15,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922128673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:15,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562663438] [2022-07-12 19:22:15,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:15,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:15,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:15,751 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:22:15,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 19:22:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:15,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 19:22:15,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:15,896 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:22:15,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:22:15,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:15,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:15,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-12 19:22:16,073 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:22:16,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 19:22:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:16,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:16,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-07-12 19:22:16,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-07-12 19:22:16,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-12 19:22:16,272 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:22:16,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-12 19:22:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:16,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562663438] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:16,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:16,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-07-12 19:22:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469035082] [2022-07-12 19:22:16,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:16,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 19:22:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:16,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 19:22:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2022-07-12 19:22:16,278 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 30 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:22:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:16,651 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-07-12 19:22:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:22:16,652 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 30 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) Word has length 34 [2022-07-12 19:22:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:16,652 INFO L225 Difference]: With dead ends: 82 [2022-07-12 19:22:16,652 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 19:22:16,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=1288, Unknown=0, NotChecked=0, Total=1560 [2022-07-12 19:22:16,653 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 445 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:16,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 367 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 394 Invalid, 0 Unknown, 111 Unchecked, 0.2s Time] [2022-07-12 19:22:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 19:22:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-12 19:22:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 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:22:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-07-12 19:22:16,655 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 34 [2022-07-12 19:22:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:16,655 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-07-12 19:22:16,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 30 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:22:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-07-12 19:22:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:22:16,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:16,656 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:16,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:16,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 19:22:16,873 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2022-07-12 19:22:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:16,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806531367] [2022-07-12 19:22:16,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:16,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:17,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:17,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806531367] [2022-07-12 19:22:17,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806531367] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:17,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587024312] [2022-07-12 19:22:17,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:17,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:17,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:17,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:22:17,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 19:22:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:17,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 19:22:17,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:17,298 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:22:17,328 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:22:17,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 19:22:17,390 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 19:22:17,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:22:17,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:17,453 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:17,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-12 19:22:17,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 19:22:17,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:17,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 19:22:17,717 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:17,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2022-07-12 19:22:17,736 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:22:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:17,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:17,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 19:22:17,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1145) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-07-12 19:22:17,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1145) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-07-12 19:22:17,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1145) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-07-12 19:22:17,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:17,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 19:22:17,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2022-07-12 19:22:17,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 19:22:17,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 19:22:17,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 19:22:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 19:22:18,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587024312] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:18,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:18,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 46 [2022-07-12 19:22:18,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588793140] [2022-07-12 19:22:18,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:18,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-12 19:22:18,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:18,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-12 19:22:18,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1748, Unknown=3, NotChecked=258, Total=2162 [2022-07-12 19:22:18,158 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 47 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 47 states have internal predecessors, (80), 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:22:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:19,210 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-07-12 19:22:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:22:19,211 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 47 states have internal predecessors, (80), 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 34 [2022-07-12 19:22:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:19,211 INFO L225 Difference]: With dead ends: 79 [2022-07-12 19:22:19,211 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 19:22:19,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=402, Invalid=3386, Unknown=6, NotChecked=366, Total=4160 [2022-07-12 19:22:19,212 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 337 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:19,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 571 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 939 Invalid, 0 Unknown, 295 Unchecked, 0.4s Time] [2022-07-12 19:22:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 19:22:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-12 19:22:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 78 states have internal predecessors, (83), 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:22:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-07-12 19:22:19,214 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 34 [2022-07-12 19:22:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:19,214 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-07-12 19:22:19,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 47 states have internal predecessors, (80), 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:22:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-07-12 19:22:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:22:19,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:19,214 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:19,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:19,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 19:22:19,421 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:19,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2022-07-12 19:22:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:19,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992253023] [2022-07-12 19:22:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:19,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:19,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992253023] [2022-07-12 19:22:19,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992253023] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:19,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124479825] [2022-07-12 19:22:19,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:19,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:19,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:19,597 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:22:19,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 19:22:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:19,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 19:22:19,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:19,698 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:22:19,716 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:19,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:22:19,734 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 19:22:19,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:22:19,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:19,767 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:19,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-12 19:22:19,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-12 19:22:19,813 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:22:19,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2022-07-12 19:22:19,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:19,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2022-07-12 19:22:19,978 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:22:19,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 19:22:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:20,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:20,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 19:22:20,449 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2022-07-12 19:22:20,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2022-07-12 19:22:20,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2022-07-12 19:22:20,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1232) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-12 19:22:20,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:20,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-12 19:22:20,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2022-07-12 19:22:20,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:20,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 98 [2022-07-12 19:22:20,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2022-07-12 19:22:20,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 118 [2022-07-12 19:22:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 19:22:20,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124479825] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:20,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:20,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 36 [2022-07-12 19:22:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984433822] [2022-07-12 19:22:20,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:20,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 19:22:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:20,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 19:22:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=956, Unknown=4, NotChecked=260, Total=1332 [2022-07-12 19:22:20,594 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 37 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 37 states have internal predecessors, (88), 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:22:21,060 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-12 19:22:21,404 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2022-07-12 19:22:21,765 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-12 19:22:22,104 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2022-07-12 19:22:22,395 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2022-07-12 19:22:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:22,699 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-12 19:22:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:22:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 37 states have internal predecessors, (88), 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 34 [2022-07-12 19:22:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:22,699 INFO L225 Difference]: With dead ends: 78 [2022-07-12 19:22:22,700 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 19:22:22,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=239, Invalid=1594, Unknown=9, NotChecked=810, Total=2652 [2022-07-12 19:22:22,701 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 283 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:22,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 526 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 489 Invalid, 0 Unknown, 391 Unchecked, 0.2s Time] [2022-07-12 19:22:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 19:22:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-12 19:22:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 77 states have internal predecessors, (82), 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:22:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-07-12 19:22:22,703 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 34 [2022-07-12 19:22:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:22,703 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-12 19:22:22,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 37 states have internal predecessors, (88), 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:22:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-07-12 19:22:22,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:22:22,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:22,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:22,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:22,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 19:22:22,919 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2022-07-12 19:22:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242598874] [2022-07-12 19:22:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:23,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:22:23,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242598874] [2022-07-12 19:22:23,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242598874] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:22:23,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503806491] [2022-07-12 19:22:23,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:23,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:22:23,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:23,298 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:22:23,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 19:22:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:23,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 19:22:23,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:23,398 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:22:23,429 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:22:23,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 19:22:23,493 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 19:22:23,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:22:23,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:23,553 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:23,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-12 19:22:23,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-12 19:22:23,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-07-12 19:22:23,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:23,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:23,844 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:23,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 55 [2022-07-12 19:22:24,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-12 19:22:24,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-12 19:22:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:24,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:25,551 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0))))) is different from false [2022-07-12 19:22:28,859 INFO L356 Elim1Store]: treesize reduction 8, result has 85.5 percent of original size [2022-07-12 19:22:28,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 141 [2022-07-12 19:22:28,947 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_10 Int)) (or (not (<= v_prenex_10 0)) (not (<= 0 v_prenex_10)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (.cse0 (forall ((v_ArrVal_1322 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (not (let ((.cse5 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse5 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse5 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))))) (.cse1 (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse4 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_7))) (or (= .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (and .cse0 (or .cse1 .cse2) .cse2 (or .cse0 .cse1) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse3 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_7))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= 0 v_prenex_7)) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (<= v_prenex_7 0))))))) is different from false [2022-07-12 19:22:28,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:28,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2022-07-12 19:22:28,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 305 [2022-07-12 19:22:28,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:28,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 195 [2022-07-12 19:22:28,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 381 [2022-07-12 19:22:28,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 393 treesize of output 385 [2022-07-12 19:22:29,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:29,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 45 [2022-07-12 19:22:29,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 237 [2022-07-12 19:22:29,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:29,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:29,207 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:29,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 317 [2022-07-12 19:22:29,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:29,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 368 treesize of output 344 [2022-07-12 19:22:29,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:22:29,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 506 treesize of output 458 [2022-07-12 19:22:29,275 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:22:29,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2022-07-12 19:22:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 19:22:29,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503806491] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:29,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:22:29,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 54 [2022-07-12 19:22:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247952422] [2022-07-12 19:22:29,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:29,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-12 19:22:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:22:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-12 19:22:29,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2570, Unknown=3, NotChecked=206, Total=2970 [2022-07-12 19:22:29,477 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 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:22:31,656 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_10 Int)) (or (not (<= v_prenex_10 0)) (not (<= 0 v_prenex_10)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (.cse0 (forall ((v_ArrVal_1322 (Array Int Int)) (v_ArrVal_1321 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (not (let ((.cse5 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse5 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse5 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))))) (.cse1 (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse4 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_7))) (or (= .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (and .cse0 (or .cse1 .cse2) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) .cse2 (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or .cse0 .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse3 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_7))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= 0 v_prenex_7)) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (<= v_prenex_7 0))))))) is different from false [2022-07-12 19:22:32,637 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-12 19:22:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:33,602 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-07-12 19:22:33,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:22:33,603 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 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 36 [2022-07-12 19:22:33,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:33,603 INFO L225 Difference]: With dead ends: 79 [2022-07-12 19:22:33,603 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 19:22:33,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=404, Invalid=4029, Unknown=5, NotChecked=532, Total=4970 [2022-07-12 19:22:33,604 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 300 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:33,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 754 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 868 Invalid, 0 Unknown, 485 Unchecked, 0.3s Time] [2022-07-12 19:22:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 19:22:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-07-12 19:22:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 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:22:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-07-12 19:22:33,606 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 36 [2022-07-12 19:22:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:33,606 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-07-12 19:22:33,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 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:22:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-07-12 19:22:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:22:33,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:33,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:33,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:33,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 19:22:33,823 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:33,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1615055412, now seen corresponding path program 1 times [2022-07-12 19:22:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:22:33,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272610431] [2022-07-12 19:22:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:22:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:22:33,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 19:22:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:22:33,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 19:22:33,879 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 19:22:33,879 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2022-07-12 19:22:33,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2022-07-12 19:22:33,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2022-07-12 19:22:33,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2022-07-12 19:22:33,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2022-07-12 19:22:33,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2022-07-12 19:22:33,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2022-07-12 19:22:33,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2022-07-12 19:22:33,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2022-07-12 19:22:33,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2022-07-12 19:22:33,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2022-07-12 19:22:33,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2022-07-12 19:22:33,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2022-07-12 19:22:33,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2022-07-12 19:22:33,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2022-07-12 19:22:33,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2022-07-12 19:22:33,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2022-07-12 19:22:33,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (41 of 59 remaining) [2022-07-12 19:22:33,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (40 of 59 remaining) [2022-07-12 19:22:33,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (39 of 59 remaining) [2022-07-12 19:22:33,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (38 of 59 remaining) [2022-07-12 19:22:33,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (37 of 59 remaining) [2022-07-12 19:22:33,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (36 of 59 remaining) [2022-07-12 19:22:33,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (35 of 59 remaining) [2022-07-12 19:22:33,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (34 of 59 remaining) [2022-07-12 19:22:33,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (33 of 59 remaining) [2022-07-12 19:22:33,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE (32 of 59 remaining) [2022-07-12 19:22:33,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE (31 of 59 remaining) [2022-07-12 19:22:33,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE (30 of 59 remaining) [2022-07-12 19:22:33,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE (29 of 59 remaining) [2022-07-12 19:22:33,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE (28 of 59 remaining) [2022-07-12 19:22:33,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (27 of 59 remaining) [2022-07-12 19:22:33,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (26 of 59 remaining) [2022-07-12 19:22:33,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (25 of 59 remaining) [2022-07-12 19:22:33,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (24 of 59 remaining) [2022-07-12 19:22:33,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (23 of 59 remaining) [2022-07-12 19:22:33,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (22 of 59 remaining) [2022-07-12 19:22:33,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (21 of 59 remaining) [2022-07-12 19:22:33,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (20 of 59 remaining) [2022-07-12 19:22:33,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (19 of 59 remaining) [2022-07-12 19:22:33,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (18 of 59 remaining) [2022-07-12 19:22:33,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (17 of 59 remaining) [2022-07-12 19:22:33,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (16 of 59 remaining) [2022-07-12 19:22:33,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (15 of 59 remaining) [2022-07-12 19:22:33,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (14 of 59 remaining) [2022-07-12 19:22:33,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (13 of 59 remaining) [2022-07-12 19:22:33,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (12 of 59 remaining) [2022-07-12 19:22:33,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (11 of 59 remaining) [2022-07-12 19:22:33,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (10 of 59 remaining) [2022-07-12 19:22:33,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (9 of 59 remaining) [2022-07-12 19:22:33,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (8 of 59 remaining) [2022-07-12 19:22:33,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (7 of 59 remaining) [2022-07-12 19:22:33,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (6 of 59 remaining) [2022-07-12 19:22:33,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (5 of 59 remaining) [2022-07-12 19:22:33,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (4 of 59 remaining) [2022-07-12 19:22:33,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (3 of 59 remaining) [2022-07-12 19:22:33,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (2 of 59 remaining) [2022-07-12 19:22:33,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (1 of 59 remaining) [2022-07-12 19:22:33,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (0 of 59 remaining) [2022-07-12 19:22:33,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 19:22:33,890 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:33,892 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 19:22:33,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:22:33 BoogieIcfgContainer [2022-07-12 19:22:33,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 19:22:33,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 19:22:33,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 19:22:33,920 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 19:22:33,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:21:55" (3/4) ... [2022-07-12 19:22:33,922 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 19:22:33,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 19:22:33,924 INFO L158 Benchmark]: Toolchain (without parser) took 39566.80ms. Allocated memory was 107.0MB in the beginning and 213.9MB in the end (delta: 107.0MB). Free memory was 75.9MB in the beginning and 151.7MB in the end (delta: -75.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2022-07-12 19:22:33,925 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 63.8MB in the beginning and 63.7MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:22:33,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.78ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 75.7MB in the beginning and 112.3MB in the end (delta: -36.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 19:22:33,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.27ms. Allocated memory is still 144.7MB. Free memory was 112.3MB in the beginning and 110.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:22:33,928 INFO L158 Benchmark]: Boogie Preprocessor took 21.60ms. Allocated memory is still 144.7MB. Free memory was 110.2MB in the beginning and 108.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:22:33,928 INFO L158 Benchmark]: RCFGBuilder took 421.71ms. Allocated memory is still 144.7MB. Free memory was 108.5MB in the beginning and 90.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-12 19:22:33,928 INFO L158 Benchmark]: TraceAbstraction took 38727.43ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 90.4MB in the beginning and 151.7MB in the end (delta: -61.3MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2022-07-12 19:22:33,929 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 213.9MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:22:33,929 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.14ms. Allocated memory is still 107.0MB. Free memory was 63.8MB in the beginning and 63.7MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.78ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 75.7MB in the beginning and 112.3MB in the end (delta: -36.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.27ms. Allocated memory is still 144.7MB. Free memory was 112.3MB in the beginning and 110.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.60ms. Allocated memory is still 144.7MB. Free memory was 110.2MB in the beginning and 108.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 421.71ms. Allocated memory is still 144.7MB. Free memory was 108.5MB in the beginning and 90.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 38727.43ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 90.4MB in the beginning and 151.7MB in the end (delta: -61.3MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 213.9MB. Free memory is still 151.7MB. There was no memory consumed. 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 - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 616. Possible FailurePath: [L617] const int len = 3; [L618] CALL, EXPR dll_circular_create(len) [L564] DLL last = (DLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == last) VAL [\old(len)=3, last={6:0}, len=3] [L568] last->next = last VAL [\old(len)=3, last={6:0}, len=3] [L569] last->prev = last VAL [\old(len)=3, last={6:0}, len=3] [L570] DLL head = last; VAL [\old(len)=3, head={6:0}, last={6:0}, len=3] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={6:0}, last={6:0}, len=3, new_head={-2:0}] [L576] new_head->next = head VAL [\old(len)=3, head={6:0}, last={6:0}, len=3, new_head={-2:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={6:0}, last={6:0}, len=3, new_head={-2:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={-2:0}, last={6:0}, len=2, new_head={-2:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-2:0}, last={6:0}, len=2, new_head={5:0}] [L576] new_head->next = head VAL [\old(len)=3, head={-2:0}, last={6:0}, len=2, new_head={5:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={-2:0}, last={6:0}, len=2, new_head={5:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={5:0}, last={6:0}, len=1, new_head={5:0}] [L571] COND FALSE !(len > 1) VAL [\old(len)=3, head={5:0}, last={6:0}, len=1, new_head={5:0}] [L581] last->next = head VAL [\old(len)=3, head={5:0}, last={6:0}, len=1, new_head={5:0}] [L582] head->prev = last VAL [\old(len)=3, head={5:0}, last={6:0}, len=1, new_head={5:0}] [L583] return head; VAL [\old(len)=3, \result={5:0}, head={5:0}, last={6:0}, len=1, new_head={5:0}] [L618] RET, EXPR dll_circular_create(len) [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) [L586] EXPR head->prev VAL [head={5:0}, head={5:0}, head->prev={6:0}] [L586] DLL pred = head->prev; [L587] EXPR head->next VAL [head={5:0}, head={5:0}, head->next={-2:0}, pred={6:0}] [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND FALSE !(__VERIFIER_nondet_int()) [L607] free(pred) VAL [head={5:0}, head={5:0}, pred={6:0}, succ={-2:0}] [L607] free(pred) VAL [head={5:0}, head={5:0}, pred={6:0}, succ={-2:0}] [L607] free(pred) [L608] COND FALSE !(__VERIFIER_nondet_int()) [L612] free(head) VAL [head={5:0}, head={5:0}, pred={6:0}, succ={-2:0}] [L612] free(head) VAL [head={5:0}, head={5:0}, pred={6:0}, succ={-2:0}] [L612] free(head) [L619] RET _destroy_in_nondeterministic_order(head) [L620] head = ((void *)0) [L621] return 0; VAL [\result=0, head={0:0}, len=3] - 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: -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: -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: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 134 locations, 59 error locations. Started 1 CEGAR loops. OverallTime: 38.7s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6654 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6654 mSDsluCounter, 10222 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3157 IncrementalHoareTripleChecker+Unchecked, 8172 mSDsCounter, 474 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7740 IncrementalHoareTripleChecker+Invalid, 11371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 474 mSolverCounterUnsat, 2050 mSDtfsCounter, 7740 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1092 GetRequests, 533 SyntacticMatches, 28 SemanticMatches, 531 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 4467 ImplicationChecksByTransitivity, 24.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=15, InterpolantAutomatonStates: 245, 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, 26 MinimizatonAttempts, 114 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 986 NumberOfCodeBlocks, 986 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1234 ConstructedInterpolants, 109 QuantifiedInterpolants, 13440 SizeOfPredicates, 176 NumberOfNonLiveVariables, 2685 ConjunctsInSsa, 460 ConjunctsInUnsatCore, 51 InterpolantComputations, 14 PerfectInterpolantSequences, 90/294 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 could not prove your program: unable to determine feasibility of some traces [2022-07-12 19:22:33,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 2f737570030041640fd86c7d2770b30b4e6ee4ac0d1c521887700aab87fb1426 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:22:35,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:22:35,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:22:35,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:22:35,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:22:35,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:22:35,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:22:35,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:22:35,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:22:35,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:22:35,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:22:35,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:22:35,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:22:35,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:22:35,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:22:35,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:22:35,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:22:35,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:22:35,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:22:35,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:22:35,483 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:22:35,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:22:35,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:22:35,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:22:35,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:22:35,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:22:35,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:22:35,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:22:35,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:22:35,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:22:35,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:22:35,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:22:35,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:22:35,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:22:35,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:22:35,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:22:35,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:22:35,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:22:35,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:22:35,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:22:35,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:22:35,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:22:35,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:22:35,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:22:35,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:22:35,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:22:35,532 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:22:35,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:22:35,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:22:35,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:22:35,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:22:35,533 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:22:35,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:22:35,539 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:22:35,539 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:22:35,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:22:35,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:22:35,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:22:35,540 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:22:35,540 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:22:35,540 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:22:35,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:22:35,541 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:22:35,541 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:22:35,541 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:22:35,541 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:22:35,541 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:22:35,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:22:35,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:22:35,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:22:35,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:22:35,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:22:35,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:22:35,543 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:22:35,543 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:22:35,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:22:35,543 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 2f737570030041640fd86c7d2770b30b4e6ee4ac0d1c521887700aab87fb1426 [2022-07-12 19:22:35,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:22:35,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:22:35,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:22:35,807 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:22:35,808 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:22:35,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2022-07-12 19:22:35,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c328e34/3c4db8dd6cc542aa8e267a27bc725fc3/FLAG8ef3ae34d [2022-07-12 19:22:36,215 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:22:36,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2022-07-12 19:22:36,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c328e34/3c4db8dd6cc542aa8e267a27bc725fc3/FLAG8ef3ae34d [2022-07-12 19:22:36,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c328e34/3c4db8dd6cc542aa8e267a27bc725fc3 [2022-07-12 19:22:36,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:22:36,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:22:36,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:22:36,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:22:36,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:22:36,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:22:36" (1/1) ... [2022-07-12 19:22:36,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d3f70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36, skipping insertion in model container [2022-07-12 19:22:36,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:22:36" (1/1) ... [2022-07-12 19:22:36,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:22:36,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:22:36,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:22:36,881 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:22:36,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:22:36,942 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:22:36,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36 WrapperNode [2022-07-12 19:22:36,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:22:36,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:22:36,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:22:36,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:22:36,949 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:22:36" (1/1) ... [2022-07-12 19:22:36,975 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:22:36" (1/1) ... [2022-07-12 19:22:36,999 INFO L137 Inliner]: procedures = 117, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2022-07-12 19:22:36,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:22:37,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:22:37,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:22:37,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:22:37,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36" (1/1) ... [2022-07-12 19:22:37,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36" (1/1) ... [2022-07-12 19:22:37,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36" (1/1) ... [2022-07-12 19:22:37,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36" (1/1) ... [2022-07-12 19:22:37,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36" (1/1) ... [2022-07-12 19:22:37,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36" (1/1) ... [2022-07-12 19:22:37,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36" (1/1) ... [2022-07-12 19:22:37,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:22:37,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:22:37,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:22:37,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:22:37,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36" (1/1) ... [2022-07-12 19:22:37,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:22:37,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:22:37,066 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:22:37,085 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:22:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-12 19:22:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-12 19:22:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:22:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:22:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:22:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:22:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:22:37,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:22:37,155 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:22:37,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:22:37,186 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-12 19:22:37,448 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:22:37,454 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:22:37,454 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 19:22:37,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:22:37 BoogieIcfgContainer [2022-07-12 19:22:37,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:22:37,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:22:37,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:22:37,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:22:37,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:22:36" (1/3) ... [2022-07-12 19:22:37,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440fb008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:22:37, skipping insertion in model container [2022-07-12 19:22:37,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:22:36" (2/3) ... [2022-07-12 19:22:37,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440fb008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:22:37, skipping insertion in model container [2022-07-12 19:22:37,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:22:37" (3/3) ... [2022-07-12 19:22:37,461 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2022-07-12 19:22:37,469 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:22:37,470 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2022-07-12 19:22:37,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:22:37,502 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@1c2426dc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60d6173b [2022-07-12 19:22:37,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2022-07-12 19:22:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 131 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 19:22:37,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:37,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 19:22:37,510 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:37,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-07-12 19:22:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:37,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959769274] [2022-07-12 19:22:37,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:37,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:37,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:37,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:37,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 19:22:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:37,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:22:37,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:37,602 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:22:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:37,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:37,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:37,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959769274] [2022-07-12 19:22:37,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959769274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:37,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:37,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:22:37,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329964230] [2022-07-12 19:22:37,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:37,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:22:37,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:37,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:22:37,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:22:37,632 INFO L87 Difference]: Start difference. First operand has 133 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 131 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 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), 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:22:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:37,755 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-07-12 19:22:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:22:37,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) 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:22:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:37,761 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:22:37,762 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:22:37,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:22:37,764 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 50 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:37,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 165 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:22:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-12 19:22:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 123 states have internal predecessors, (129), 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:22:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-07-12 19:22:37,787 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 4 [2022-07-12 19:22:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:37,787 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-07-12 19:22:37,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) 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:22:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-07-12 19:22:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 19:22:37,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:37,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 19:22:37,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 19:22:37,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:37,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-07-12 19:22:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:37,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145390625] [2022-07-12 19:22:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:37,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:37,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:37,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:37,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 19:22:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:38,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:22:38,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:38,038 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:22:38,049 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:22:38,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:38,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:38,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145390625] [2022-07-12 19:22:38,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145390625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:38,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:38,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:22:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126438823] [2022-07-12 19:22:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:38,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:22:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:22:38,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:22:38,051 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 3 states, 2 states have (on average 2.0) 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:22:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:38,098 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-12 19:22:38,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:22:38,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) 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:22:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:38,100 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:22:38,100 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:22:38,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:22:38,101 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 122 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:38,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 111 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:22:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:22:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 19:22:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 120 states have internal predecessors, (126), 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:22:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-12 19:22:38,107 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 4 [2022-07-12 19:22:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:38,107 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-12 19:22:38,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) 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:22:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-12 19:22:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:22:38,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:38,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:38,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:38,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:38,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:38,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2022-07-12 19:22:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:38,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150968704] [2022-07-12 19:22:38,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:38,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:38,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:38,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:38,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 19:22:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:38,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:22:38,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:38,360 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:22:38,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:38,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:38,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150968704] [2022-07-12 19:22:38,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150968704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:38,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:38,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:22:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166538828] [2022-07-12 19:22:38,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:38,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:22:38,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:38,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:22:38,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:22:38,361 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:38,372 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-07-12 19:22:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:22:38,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:22:38,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:38,373 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:22:38,373 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 19:22:38,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:22:38,374 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:38,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 242 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:22:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 19:22:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2022-07-12 19:22:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 121 states have internal predecessors, (127), 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:22:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2022-07-12 19:22:38,380 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 9 [2022-07-12 19:22:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:38,381 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2022-07-12 19:22:38,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-07-12 19:22:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:22:38,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:38,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:38,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:38,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:38,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-07-12 19:22:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:38,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093946521] [2022-07-12 19:22:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:38,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:38,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:38,594 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:38,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 19:22:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:38,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:22:38,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:38,648 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:22:38,663 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:22:38,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:38,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:38,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093946521] [2022-07-12 19:22:38,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093946521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:38,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:38,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:22:38,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001673150] [2022-07-12 19:22:38,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:38,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:22:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:22:38,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:22:38,669 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:38,751 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-12 19:22:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:22:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:22:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:38,755 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:22:38,755 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:22:38,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:22:38,756 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:38,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 159 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:22:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 19:22:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.826086956521739) internal successors, (126), 120 states have internal predecessors, (126), 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:22:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-12 19:22:38,771 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 9 [2022-07-12 19:22:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:38,774 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-12 19:22:38,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-12 19:22:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:22:38,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:38,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:38,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:38,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:38,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:38,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:38,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-07-12 19:22:38,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:38,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829315188] [2022-07-12 19:22:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:38,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:38,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:38,984 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:38,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 19:22:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:39,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:22:39,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:39,044 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:22:39,056 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:22:39,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:39,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829315188] [2022-07-12 19:22:39,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829315188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:39,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:39,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:22:39,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816077550] [2022-07-12 19:22:39,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:39,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:22:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:39,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:22:39,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:22:39,057 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:39,090 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-07-12 19:22:39,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:22:39,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:22:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:39,093 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:22:39,093 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:22:39,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:22:39,094 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 116 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:39,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 115 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:22:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:22:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 19:22:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 119 states have internal predecessors, (125), 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:22:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-07-12 19:22:39,098 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 9 [2022-07-12 19:22:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:39,098 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-07-12 19:22:39,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-07-12 19:22:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 19:22:39,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:39,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:39,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:39,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:39,306 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:39,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2022-07-12 19:22:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:39,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401624070] [2022-07-12 19:22:39,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:39,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:39,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:39,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:39,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 19:22:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:39,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:22:39,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:39,366 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:22:39,396 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:22:39,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-12 19:22:39,411 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:22:39,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:39,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:39,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401624070] [2022-07-12 19:22:39,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401624070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:39,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:39,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:22:39,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920811080] [2022-07-12 19:22:39,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:39,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:22:39,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:39,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:22:39,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:22:39,412 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) 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:22:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:39,511 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-12 19:22:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:22:39,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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 10 [2022-07-12 19:22:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:39,512 INFO L225 Difference]: With dead ends: 124 [2022-07-12 19:22:39,512 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:22:39,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:22:39,512 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:39,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 205 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:22:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-12 19:22:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 122 states have internal predecessors, (129), 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:22:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2022-07-12 19:22:39,516 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 10 [2022-07-12 19:22:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:39,516 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2022-07-12 19:22:39,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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:22:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2022-07-12 19:22:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 19:22:39,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:39,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:39,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:39,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:39,723 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:39,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:39,723 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2022-07-12 19:22:39,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:39,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633919349] [2022-07-12 19:22:39,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:39,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:39,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:39,724 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:39,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 19:22:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:39,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:22:39,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:39,784 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:22:39,787 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:22:39,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:39,835 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:22:39,842 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:22:39,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:22:39,860 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:22:39,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:39,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:39,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633919349] [2022-07-12 19:22:39,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633919349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:39,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:39,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:22:39,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847465399] [2022-07-12 19:22:39,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:39,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:22:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:39,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:22:39,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:22:39,862 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:39,963 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-12 19:22:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:22:39,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 19:22:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:39,964 INFO L225 Difference]: With dead ends: 124 [2022-07-12 19:22:39,964 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:22:39,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:22:39,964 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 49 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:39,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 246 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:22:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-12 19:22:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7777777777777777) internal successors, (128), 122 states have internal predecessors, (128), 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:22:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2022-07-12 19:22:39,976 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 10 [2022-07-12 19:22:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:39,976 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2022-07-12 19:22:39,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2022-07-12 19:22:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 19:22:39,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:39,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:39,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-12 19:22:40,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:40,177 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2022-07-12 19:22:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:40,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743205578] [2022-07-12 19:22:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:40,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:40,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:40,179 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:40,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 19:22:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:40,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:22:40,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:40,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:40,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:40,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743205578] [2022-07-12 19:22:40,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743205578] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:40,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:22:40,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 19:22:40,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606348623] [2022-07-12 19:22:40,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:40,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:22:40,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:22:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:22:40,314 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:40,328 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2022-07-12 19:22:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:22:40,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 19:22:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:40,328 INFO L225 Difference]: With dead ends: 131 [2022-07-12 19:22:40,329 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 19:22:40,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:22:40,329 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 19 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:40,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 472 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:22:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 19:22:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2022-07-12 19:22:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 124 states have internal predecessors, (130), 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:22:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2022-07-12 19:22:40,332 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 14 [2022-07-12 19:22:40,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:40,332 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2022-07-12 19:22:40,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-07-12 19:22:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:22:40,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:40,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:40,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:40,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:40,533 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2022-07-12 19:22:40,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:40,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581860329] [2022-07-12 19:22:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:40,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:40,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:40,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:40,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 19:22:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:40,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:22:40,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:40,609 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:22:40,636 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:22:40,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-12 19:22:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:40,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:40,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:40,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581860329] [2022-07-12 19:22:40,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581860329] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:40,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:22:40,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-12 19:22:40,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404048142] [2022-07-12 19:22:40,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:40,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:22:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:40,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:22:40,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:22:40,668 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:22:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:40,762 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2022-07-12 19:22:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:22:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-07-12 19:22:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:40,763 INFO L225 Difference]: With dead ends: 123 [2022-07-12 19:22:40,763 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 19:22:40,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:22:40,764 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 68 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:40,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 208 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 19:22:40,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-12 19:22:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 122 states have internal predecessors, (128), 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:22:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2022-07-12 19:22:40,766 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 15 [2022-07-12 19:22:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:40,766 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2022-07-12 19:22:40,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:22:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2022-07-12 19:22:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:22:40,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:40,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:40,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:40,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:40,971 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2022-07-12 19:22:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:40,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101506810] [2022-07-12 19:22:40,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:40,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:40,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:40,973 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:40,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 19:22:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:41,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:22:41,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:41,051 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:22:41,054 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:22:41,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:41,114 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:22:41,120 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:22:41,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:22:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:41,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:45,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:45,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101506810] [2022-07-12 19:22:45,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101506810] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:45,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:22:45,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-12 19:22:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301294195] [2022-07-12 19:22:45,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:45,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:22:45,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:22:45,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:22:45,358 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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:22:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:45,495 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-12 19:22:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:22:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 15 [2022-07-12 19:22:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:45,496 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:22:45,496 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:22:45,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:22:45,496 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 277 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:45,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 261 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 69 Unchecked, 0.1s Time] [2022-07-12 19:22:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:22:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 19:22:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 1.7027027027027026) internal successors, (126), 120 states have internal predecessors, (126), 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:22:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-12 19:22:45,499 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 15 [2022-07-12 19:22:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:45,499 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-12 19:22:45,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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:22:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-12 19:22:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:22:45,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:45,499 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:45,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:45,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:45,700 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:45,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2022-07-12 19:22:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:45,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756798582] [2022-07-12 19:22:45,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:45,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:45,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:45,702 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:45,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 19:22:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:45,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:22:45,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:45,781 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:22:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:45,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:45,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:45,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756798582] [2022-07-12 19:22:45,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756798582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:45,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:45,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:22:45,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041121896] [2022-07-12 19:22:45,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:45,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:22:45,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:45,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:22:45,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:22:45,809 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:45,961 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2022-07-12 19:22:45,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:22:45,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:22:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:45,962 INFO L225 Difference]: With dead ends: 118 [2022-07-12 19:22:45,962 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 19:22:45,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:22:45,963 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 106 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:45,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 303 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 19:22:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-12 19:22:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 74 states have (on average 1.662162162162162) internal successors, (123), 117 states have internal predecessors, (123), 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:22:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2022-07-12 19:22:45,965 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 22 [2022-07-12 19:22:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:45,965 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2022-07-12 19:22:45,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2022-07-12 19:22:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:22:45,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:45,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:45,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:46,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:46,172 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2022-07-12 19:22:46,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:46,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22787706] [2022-07-12 19:22:46,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:46,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:46,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:46,173 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:46,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 19:22:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:46,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:22:46,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:46,273 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:22:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:46,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:46,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:46,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22787706] [2022-07-12 19:22:46,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22787706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:46,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:46,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:22:46,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229473350] [2022-07-12 19:22:46,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:46,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:22:46,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:46,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:22:46,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:22:46,330 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:46,472 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-07-12 19:22:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:22:46,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:22:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:46,473 INFO L225 Difference]: With dead ends: 111 [2022-07-12 19:22:46,474 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 19:22:46,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:22:46,474 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 388 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:46,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 89 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 19:22:46,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-12 19:22:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 110 states have internal predecessors, (116), 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:22:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2022-07-12 19:22:46,476 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 22 [2022-07-12 19:22:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:46,476 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2022-07-12 19:22:46,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2022-07-12 19:22:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:22:46,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:46,477 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:46,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:46,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:46,686 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2022-07-12 19:22:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:46,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110029703] [2022-07-12 19:22:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:46,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:46,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:46,687 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:46,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 19:22:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:46,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:22:46,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:46,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:46,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:46,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110029703] [2022-07-12 19:22:46,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110029703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:46,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:46,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:22:46,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014475116] [2022-07-12 19:22:46,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:46,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:22:46,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:46,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:22:46,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:22:46,993 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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:22:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:47,014 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-07-12 19:22:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:22:47,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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) Word has length 28 [2022-07-12 19:22:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:47,015 INFO L225 Difference]: With dead ends: 110 [2022-07-12 19:22:47,015 INFO L226 Difference]: Without dead ends: 110 [2022-07-12 19:22:47,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:22:47,015 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 67 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:47,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 206 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2022-07-12 19:22:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-12 19:22:47,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-12 19:22:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.554054054054054) internal successors, (115), 109 states have internal predecessors, (115), 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:22:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2022-07-12 19:22:47,017 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 28 [2022-07-12 19:22:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:47,017 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2022-07-12 19:22:47,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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:22:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2022-07-12 19:22:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:22:47,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:47,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:47,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:47,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:47,225 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:47,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:47,225 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2022-07-12 19:22:47,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:47,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521290715] [2022-07-12 19:22:47,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:47,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:47,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:47,227 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:47,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 19:22:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:47,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 19:22:47,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:47,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:22:47,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:22:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:47,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:47,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:47,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521290715] [2022-07-12 19:22:47,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521290715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:47,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:47,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:22:47,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981553094] [2022-07-12 19:22:47,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:47,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:22:47,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:47,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:22:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:22:47,434 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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:22:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:47,668 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-07-12 19:22:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:22:47,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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) Word has length 28 [2022-07-12 19:22:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:47,669 INFO L225 Difference]: With dead ends: 105 [2022-07-12 19:22:47,669 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 19:22:47,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:22:47,669 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 532 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:47,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 144 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:22:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 19:22:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-12 19:22:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 104 states have internal predecessors, (110), 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:22:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-07-12 19:22:47,671 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 28 [2022-07-12 19:22:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:47,672 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-07-12 19:22:47,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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:22:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-07-12 19:22:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:22:47,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:47,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:47,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:47,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:47,873 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2022-07-12 19:22:47,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:47,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895707782] [2022-07-12 19:22:47,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:47,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:47,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:47,888 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:47,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 19:22:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:48,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 19:22:48,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:48,015 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:22:48,078 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 19:22:48,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:22:48,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:48,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:22:48,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:22:48,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:48,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:22:48,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:22:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:48,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:48,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-12 19:22:48,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-12 19:22:48,361 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_368) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-12 19:22:48,378 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:48,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-12 19:22:48,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-07-12 19:22:48,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-07-12 19:22:48,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-12 19:22:48,593 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:22:48,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-12 19:22:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 19:22:48,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:48,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895707782] [2022-07-12 19:22:48,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895707782] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:48,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:22:48,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-07-12 19:22:48,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655342284] [2022-07-12 19:22:48,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:48,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 19:22:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:48,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 19:22:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=411, Unknown=3, NotChecked=126, Total=600 [2022-07-12 19:22:48,605 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:49,348 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-07-12 19:22:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:22:49,348 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:22:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:49,349 INFO L225 Difference]: With dead ends: 104 [2022-07-12 19:22:49,349 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:22:49,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=958, Unknown=3, NotChecked=198, Total=1332 [2022-07-12 19:22:49,350 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 427 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 504 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:49,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 531 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 433 Invalid, 0 Unknown, 504 Unchecked, 0.4s Time] [2022-07-12 19:22:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:22:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2022-07-12 19:22:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 100 states have internal predecessors, (106), 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:22:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-07-12 19:22:49,352 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 28 [2022-07-12 19:22:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:49,352 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-07-12 19:22:49,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-07-12 19:22:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:22:49,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:49,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:49,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:49,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:49,553 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2022-07-12 19:22:49,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:49,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406443515] [2022-07-12 19:22:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:49,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:49,555 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:49,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 19:22:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:49,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 19:22:49,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:49,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:22:49,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 19:22:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:49,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:49,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:49,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406443515] [2022-07-12 19:22:49,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406443515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:49,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:49,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:22:49,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586133077] [2022-07-12 19:22:49,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:49,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:22:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:22:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:22:49,859 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:50,370 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-07-12 19:22:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:22:50,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 19:22:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:50,371 INFO L225 Difference]: With dead ends: 96 [2022-07-12 19:22:50,371 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 19:22:50,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:22:50,372 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 653 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:50,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 67 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:22:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 19:22:50,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-12 19:22:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.364864864864865) 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:22:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-07-12 19:22:50,374 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 29 [2022-07-12 19:22:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:50,374 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-07-12 19:22:50,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-07-12 19:22:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 19:22:50,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:50,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:50,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:50,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:50,575 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:50,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2022-07-12 19:22:50,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:50,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166587293] [2022-07-12 19:22:50,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:50,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:50,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:50,577 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:50,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 19:22:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:50,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:22:50,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:50,703 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:22:50,769 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 19:22:50,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:22:50,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:50,840 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:50,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-12 19:22:50,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-12 19:22:50,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:50,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-12 19:22:51,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 19:22:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:51,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:51,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:22:51,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_456) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-12 19:22:51,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:51,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-12 19:22:51,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-07-12 19:22:51,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-07-12 19:22:51,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2022-07-12 19:22:51,485 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:22:51,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-12 19:22:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 19:22:51,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:51,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166587293] [2022-07-12 19:22:51,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166587293] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:51,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:22:51,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-07-12 19:22:51,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120197873] [2022-07-12 19:22:51,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:51,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 19:22:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 19:22:51,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=439, Unknown=11, NotChecked=86, Total=600 [2022-07-12 19:22:51,495 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:52,508 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2022-07-12 19:22:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:22:52,508 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 19:22:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:52,509 INFO L225 Difference]: With dead ends: 181 [2022-07-12 19:22:52,509 INFO L226 Difference]: Without dead ends: 181 [2022-07-12 19:22:52,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=739, Unknown=11, NotChecked=114, Total=992 [2022-07-12 19:22:52,510 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 491 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 680 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:52,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 565 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 592 Invalid, 0 Unknown, 680 Unchecked, 0.7s Time] [2022-07-12 19:22:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-12 19:22:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 133. [2022-07-12 19:22:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3243243243243243) internal successors, (147), 132 states have internal predecessors, (147), 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:22:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2022-07-12 19:22:52,512 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 29 [2022-07-12 19:22:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:52,512 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2022-07-12 19:22:52,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2022-07-12 19:22:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:22:52,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:52,513 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:52,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-12 19:22:52,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:52,720 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2022-07-12 19:22:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:52,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573780994] [2022-07-12 19:22:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:52,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:52,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:52,722 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:52,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 19:22:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:52,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:22:52,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:52,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:22:52,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:22:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:52,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:52,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:52,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573780994] [2022-07-12 19:22:52,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573780994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:52,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:52,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:22:52,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240374738] [2022-07-12 19:22:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:52,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:22:52,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:52,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:22:52,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:22:52,893 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:53,213 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2022-07-12 19:22:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:22:53,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 19:22:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:53,214 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:22:53,214 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:22:53,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:22:53,215 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 218 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:53,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 310 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:22:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:22:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-12 19:22:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 131 states have internal predecessors, (145), 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:22:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2022-07-12 19:22:53,217 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 30 [2022-07-12 19:22:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:53,217 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2022-07-12 19:22:53,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2022-07-12 19:22:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:22:53,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:53,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:53,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:53,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:53,424 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2022-07-12 19:22:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:53,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367556399] [2022-07-12 19:22:53,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:53,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:53,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:53,426 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:53,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 19:22:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:53,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:22:53,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:53,563 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:22:53,605 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 19:22:53,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:22:53,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:53,655 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:53,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-07-12 19:22:53,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-12 19:22:53,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:53,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2022-07-12 19:22:53,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-12 19:22:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:53,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:53,987 INFO L356 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2022-07-12 19:22:53,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-12 19:22:53,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_544) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) is different from false [2022-07-12 19:22:53,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:54,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-12 19:22:54,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-07-12 19:22:54,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2022-07-12 19:22:54,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-12 19:22:54,108 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:22:54,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-07-12 19:22:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 19:22:54,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:54,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367556399] [2022-07-12 19:22:54,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367556399] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:54,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:22:54,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2022-07-12 19:22:54,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985659553] [2022-07-12 19:22:54,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:54,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 19:22:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 19:22:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=405, Unknown=5, NotChecked=40, Total=506 [2022-07-12 19:22:54,116 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:55,026 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2022-07-12 19:22:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:22:55,027 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 19:22:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:55,027 INFO L225 Difference]: With dead ends: 131 [2022-07-12 19:22:55,027 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 19:22:55,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=916, Unknown=5, NotChecked=64, Total=1190 [2022-07-12 19:22:55,028 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 176 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:55,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 717 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 522 Invalid, 0 Unknown, 156 Unchecked, 0.4s Time] [2022-07-12 19:22:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 19:22:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-12 19:22:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 130 states have internal predecessors, (144), 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:22:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2022-07-12 19:22:55,030 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 30 [2022-07-12 19:22:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:55,030 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2022-07-12 19:22:55,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2022-07-12 19:22:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:22:55,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:55,031 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:55,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:55,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:55,238 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:55,238 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2022-07-12 19:22:55,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:55,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249987555] [2022-07-12 19:22:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:55,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:55,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:55,240 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:55,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 19:22:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:55,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:22:55,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:55,373 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:22:55,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-12 19:22:55,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:22:55,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-12 19:22:55,518 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 14 treesize of output 16 [2022-07-12 19:22:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:55,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:55,721 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:22:55,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 19:22:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:55,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:55,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249987555] [2022-07-12 19:22:55,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249987555] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:55,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:22:55,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2022-07-12 19:22:55,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025411382] [2022-07-12 19:22:55,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:55,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 19:22:55,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 19:22:55,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-07-12 19:22:55,727 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:56,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:56,401 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-07-12 19:22:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:22:56,401 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:22:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:56,401 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:22:56,401 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 19:22:56,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2022-07-12 19:22:56,402 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 274 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:56,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 372 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:22:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 19:22:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-12 19:22:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 129 states have internal predecessors, (142), 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:22:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-07-12 19:22:56,404 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 33 [2022-07-12 19:22:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:56,404 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-07-12 19:22:56,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-07-12 19:22:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:22:56,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:56,405 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:56,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:56,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:56,612 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2022-07-12 19:22:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:56,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069866187] [2022-07-12 19:22:56,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:56,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:56,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:56,614 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:56,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 19:22:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:56,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 19:22:56,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:56,746 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:22:56,785 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 19:22:56,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:22:56,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:22:56,835 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:22:56,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-07-12 19:22:56,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-12 19:22:56,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:22:56,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2022-07-12 19:22:56,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-12 19:22:57,024 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 15 treesize of output 17 [2022-07-12 19:22:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:22:57,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:22:57,178 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_640 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_640) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_640 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_640) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (_ bv1 1))))) is different from false [2022-07-12 19:22:57,194 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_640 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_640) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (_ bv1 1)))) (forall ((v_ArrVal_640 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_640) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-12 19:22:57,209 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:57,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2022-07-12 19:22:57,232 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_639) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_640) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-12 19:22:57,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:22:57,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-12 19:22:57,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-07-12 19:22:57,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2022-07-12 19:22:57,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-12 19:22:57,273 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:22:57,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-12 19:22:57,348 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:22:57,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-07-12 19:22:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 19:22:57,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:57,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069866187] [2022-07-12 19:22:57,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069866187] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:22:57,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:22:57,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-07-12 19:22:57,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996536332] [2022-07-12 19:22:57,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:22:57,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 19:22:57,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:57,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 19:22:57,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=372, Unknown=3, NotChecked=120, Total=552 [2022-07-12 19:22:57,355 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:58,119 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2022-07-12 19:22:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:22:58,119 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:22:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:58,120 INFO L225 Difference]: With dead ends: 129 [2022-07-12 19:22:58,120 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 19:22:58,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=795, Unknown=3, NotChecked=180, Total=1122 [2022-07-12 19:22:58,120 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 119 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:58,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 650 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 561 Invalid, 0 Unknown, 176 Unchecked, 0.4s Time] [2022-07-12 19:22:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 19:22:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-12 19:22:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 128 states have internal predecessors, (141), 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:22:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2022-07-12 19:22:58,122 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 33 [2022-07-12 19:22:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:58,123 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2022-07-12 19:22:58,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2022-07-12 19:22:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:22:58,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:58,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:58,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-12 19:22:58,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:58,330 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:58,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash 226977724, now seen corresponding path program 1 times [2022-07-12 19:22:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:58,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586706087] [2022-07-12 19:22:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:58,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:58,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:58,332 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:58,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 19:22:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:58,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:22:58,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:58,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:58,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:58,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586706087] [2022-07-12 19:22:58,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586706087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:58,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:58,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:22:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221569492] [2022-07-12 19:22:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:58,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:22:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:58,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:22:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:22:58,630 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:58,633 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2022-07-12 19:22:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:22:58,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:22:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:58,635 INFO L225 Difference]: With dead ends: 128 [2022-07-12 19:22:58,635 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 19:22:58,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:22:58,636 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 25 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:58,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 242 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 53 Unchecked, 0.0s Time] [2022-07-12 19:22:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 19:22:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-12 19:22:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 127 states have internal predecessors, (140), 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:22:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-07-12 19:22:58,638 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 33 [2022-07-12 19:22:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:58,638 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-07-12 19:22:58,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-07-12 19:22:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:22:58,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:58,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:58,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:58,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:58,845 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:58,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash 226963822, now seen corresponding path program 1 times [2022-07-12 19:22:58,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:58,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511874264] [2022-07-12 19:22:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:58,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:58,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:58,847 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:58,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 19:22:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:58,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:22:58,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:59,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:59,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511874264] [2022-07-12 19:22:59,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511874264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:59,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:59,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:22:59,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215617800] [2022-07-12 19:22:59,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:59,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:22:59,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:59,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:22:59,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:22:59,181 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:59,184 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2022-07-12 19:22:59,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:22:59,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:22:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:59,185 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:22:59,186 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:22:59,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:22:59,187 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 28 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:59,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 224 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2022-07-12 19:22:59,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:22:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-12 19:22:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 126 states have internal predecessors, (138), 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:22:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2022-07-12 19:22:59,190 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 33 [2022-07-12 19:22:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:59,190 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2022-07-12 19:22:59,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2022-07-12 19:22:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:22:59,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:59,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:59,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:59,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:59,398 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:59,399 INFO L85 PathProgramCache]: Analyzing trace with hash -262609016, now seen corresponding path program 1 times [2022-07-12 19:22:59,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:59,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565321111] [2022-07-12 19:22:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:59,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:59,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:59,400 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:59,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 19:22:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:22:59,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:22:59,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:22:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:22:59,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:22:59,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:22:59,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565321111] [2022-07-12 19:22:59,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565321111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:22:59,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:22:59,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:22:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73526738] [2022-07-12 19:22:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:22:59,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:22:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:22:59,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:22:59,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:22:59,728 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:22:59,741 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-12 19:22:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:22:59,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:22:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:22:59,742 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:22:59,742 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:22:59,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:22:59,743 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 67 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:22:59,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 220 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 60 Unchecked, 0.0s Time] [2022-07-12 19:22:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:22:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-12 19:22:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 111 states have (on average 1.2342342342342343) internal successors, (137), 125 states have internal predecessors, (137), 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:22:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2022-07-12 19:22:59,745 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 33 [2022-07-12 19:22:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:22:59,745 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2022-07-12 19:22:59,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:22:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-07-12 19:22:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:22:59,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:22:59,745 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:22:59,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 19:22:59,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:22:59,946 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:22:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:22:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2022-07-12 19:22:59,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:22:59,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218967373] [2022-07-12 19:22:59,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:22:59,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:22:59,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:22:59,948 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:22:59,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 19:23:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:23:00,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:23:00,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:23:00,084 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:23:00,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-12 19:23:00,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:23:00,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-12 19:23:00,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-07-12 19:23:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:23:00,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:23:00,480 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:23:00,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 19:23:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:23:00,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:23:00,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218967373] [2022-07-12 19:23:00,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218967373] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:23:00,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:23:00,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-07-12 19:23:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312921589] [2022-07-12 19:23:00,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:23:00,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:23:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:23:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:23:00,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:23:00,487 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 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:23:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:23:00,848 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-07-12 19:23:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:23:00,849 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 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) Word has length 34 [2022-07-12 19:23:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:23:00,849 INFO L225 Difference]: With dead ends: 124 [2022-07-12 19:23:00,849 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:23:00,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-07-12 19:23:00,850 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:23:00,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 419 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 200 Invalid, 0 Unknown, 278 Unchecked, 0.2s Time] [2022-07-12 19:23:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:23:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-12 19:23:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 123 states have internal predecessors, (134), 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:23:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2022-07-12 19:23:00,852 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 34 [2022-07-12 19:23:00,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:23:00,852 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2022-07-12 19:23:00,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 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:23:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-07-12 19:23:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:23:00,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:23:00,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:23:00,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-12 19:23:01,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:23:01,060 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:23:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:23:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2022-07-12 19:23:01,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:23:01,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397455131] [2022-07-12 19:23:01,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:23:01,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:23:01,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:23:01,061 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:23:01,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 19:23:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:23:01,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 19:23:01,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:23:01,192 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:23:01,218 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:23:01,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-12 19:23:01,291 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 19:23:01,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2022-07-12 19:23:01,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:23:01,346 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:23:01,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-12 19:23:01,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 19:23:01,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:23:01,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 19:23:01,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:01,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2022-07-12 19:23:01,685 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:23:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:23:01,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:23:01,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 19:23:01,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_853) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-07-12 19:23:01,932 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_853) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-07-12 19:23:01,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_852) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_853) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-07-12 19:23:01,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:01,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 19:23:01,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2022-07-12 19:23:01,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 19:23:01,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 19:23:01,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 19:23:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 19:23:08,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:23:08,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397455131] [2022-07-12 19:23:08,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397455131] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:23:08,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:23:08,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 33 [2022-07-12 19:23:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360664555] [2022-07-12 19:23:08,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:23:08,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 19:23:08,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:23:08,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 19:23:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=829, Unknown=4, NotChecked=180, Total=1122 [2022-07-12 19:23:08,485 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 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:23:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:23:11,127 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-07-12 19:23:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 19:23:11,127 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 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 34 [2022-07-12 19:23:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:23:11,128 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:23:11,128 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:23:11,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=367, Invalid=1803, Unknown=4, NotChecked=276, Total=2450 [2022-07-12 19:23:11,129 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 307 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:23:11,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 418 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 700 Invalid, 0 Unknown, 335 Unchecked, 0.8s Time] [2022-07-12 19:23:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:23:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 19:23:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 120 states have internal predecessors, (131), 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:23:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2022-07-12 19:23:11,133 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 34 [2022-07-12 19:23:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:23:11,133 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2022-07-12 19:23:11,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 states have internal predecessors, (57), 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:23:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2022-07-12 19:23:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:23:11,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:23:11,134 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:23:11,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-12 19:23:11,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:23:11,339 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:23:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:23:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2022-07-12 19:23:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:23:11,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142679821] [2022-07-12 19:23:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:23:11,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:23:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:23:11,341 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:23:11,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 19:23:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:23:11,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 19:23:11,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:23:11,474 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:23:11,527 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-12 19:23:11,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-07-12 19:23:11,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:23:11,634 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:23:11,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-12 19:23:11,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-07-12 19:23:11,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:23:11,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-07-12 19:23:11,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-12 19:23:11,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-12 19:23:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:23:11,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:23:12,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (_ BitVec 1)) (v_ArrVal_904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (bvneg (select (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_904) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_907) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-07-12 19:23:12,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (_ BitVec 1)) (v_ArrVal_904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_904) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (_ bv1 1)))) is different from false [2022-07-12 19:23:12,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_907 (_ BitVec 1)) (v_ArrVal_903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (bvneg (bvneg (select (store |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_904) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (_ bv0 1))) is different from false [2022-07-12 19:23:12,072 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:12,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-12 19:23:12,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 182 [2022-07-12 19:23:12,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2022-07-12 19:23:12,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 166 [2022-07-12 19:23:12,317 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:23:12,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-07-12 19:23:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 19:23:12,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:23:12,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142679821] [2022-07-12 19:23:12,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142679821] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:23:12,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:23:12,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-07-12 19:23:12,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707520579] [2022-07-12 19:23:12,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:23:12,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 19:23:12,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:23:12,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 19:23:12,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=437, Unknown=3, NotChecked=132, Total=650 [2022-07-12 19:23:12,323 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 states have internal predecessors, (57), 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:23:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:23:12,833 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-07-12 19:23:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:23:12,833 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 states have internal predecessors, (57), 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 34 [2022-07-12 19:23:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:23:12,834 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:23:12,834 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:23:12,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=790, Unknown=3, NotChecked=180, Total=1122 [2022-07-12 19:23:12,835 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 61 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:23:12,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 568 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 273 Invalid, 0 Unknown, 305 Unchecked, 0.2s Time] [2022-07-12 19:23:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:23:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 19:23:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 119 states have internal predecessors, (130), 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:23:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2022-07-12 19:23:12,837 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 34 [2022-07-12 19:23:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:23:12,837 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2022-07-12 19:23:12,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 states have internal predecessors, (57), 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:23:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2022-07-12 19:23:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:23:12,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:23:12,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:23:12,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-12 19:23:13,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:23:13,045 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:23:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:23:13,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1035188976, now seen corresponding path program 2 times [2022-07-12 19:23:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:23:13,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891244053] [2022-07-12 19:23:13,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:23:13,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:23:13,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:23:13,047 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:23:13,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 19:23:13,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:23:13,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:23:13,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:23:13,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:23:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:23:13,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:23:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:23:13,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:23:13,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891244053] [2022-07-12 19:23:13,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891244053] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:23:13,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:23:13,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 19:23:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851789742] [2022-07-12 19:23:13,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:23:13,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:23:13,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:23:13,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:23:13,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:23:13,239 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:23:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:23:13,254 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-07-12 19:23:13,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:23:13,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:23:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:23:13,255 INFO L225 Difference]: With dead ends: 79 [2022-07-12 19:23:13,255 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 19:23:13,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:23:13,256 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 67 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:23:13,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 252 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:23:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 19:23:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-12 19:23:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 78 states have internal predecessors, (83), 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:23:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-07-12 19:23:13,258 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 34 [2022-07-12 19:23:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:23:13,258 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-07-12 19:23:13,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:23:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-07-12 19:23:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:23:13,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:23:13,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:23:13,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-12 19:23:13,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:23:13,466 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:23:13,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:23:13,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2022-07-12 19:23:13,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:23:13,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607873766] [2022-07-12 19:23:13,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:23:13,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:23:13,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:23:13,468 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:23:13,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 19:23:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:23:13,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 19:23:13,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:23:13,604 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:23:13,629 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:23:13,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-12 19:23:13,707 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-12 19:23:13,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 44 [2022-07-12 19:23:13,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:23:13,804 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:23:13,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2022-07-12 19:23:13,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-12 19:23:13,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:23:13,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2022-07-12 19:23:14,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:14,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 35 [2022-07-12 19:23:14,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-12 19:23:14,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 19:23:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:23:14,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:23:14,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1009 (_ BitVec 1)) (v_ArrVal_1008 (_ BitVec 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1008) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1009) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1005) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2022-07-12 19:23:14,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1005 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1009 (_ BitVec 1)) (v_ArrVal_1008 (_ BitVec 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1008) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1009) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1005) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (_ bv1 1)))) is different from false [2022-07-12 19:23:14,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:23:14,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-12 19:23:14,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-07-12 19:23:14,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 194 [2022-07-12 19:23:14,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2022-07-12 19:23:23,038 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 64 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:24:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 19:24:24,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:24:24,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607873766] [2022-07-12 19:24:24,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607873766] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:24:24,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:24:24,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2022-07-12 19:24:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796428510] [2022-07-12 19:24:24,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:24:24,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-12 19:24:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:24:24,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-12 19:24:24,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1155, Unknown=27, NotChecked=142, Total=1482 [2022-07-12 19:24:24,220 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 39 states have internal predecessors, (68), 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:24:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:24:25,635 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-12 19:24:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:24:25,636 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 39 states have internal predecessors, (68), 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 36 [2022-07-12 19:24:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:24:25,636 INFO L225 Difference]: With dead ends: 78 [2022-07-12 19:24:25,636 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 19:24:25,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 71.0s TimeCoverageRelationStatistics Valid=281, Invalid=1956, Unknown=27, NotChecked=186, Total=2450 [2022-07-12 19:24:25,637 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 93 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 673 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:24:25,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 576 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 278 Invalid, 0 Unknown, 673 Unchecked, 0.3s Time] [2022-07-12 19:24:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 19:24:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-12 19:24:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 77 states have internal predecessors, (82), 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:24:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-07-12 19:24:25,639 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 36 [2022-07-12 19:24:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:24:25,639 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-12 19:24:25,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 39 states have internal predecessors, (68), 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:24:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-07-12 19:24:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:24:25,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:24:25,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:24:25,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-12 19:24:25,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:24:25,847 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-12 19:24:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:24:25,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1615055412, now seen corresponding path program 1 times [2022-07-12 19:24:25,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:24:25,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320797566] [2022-07-12 19:24:25,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:24:25,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:24:25,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:24:25,848 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:24:25,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 19:24:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:24:25,984 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 19:24:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:24:26,077 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 19:24:26,077 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 19:24:26,078 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2022-07-12 19:24:26,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2022-07-12 19:24:26,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2022-07-12 19:24:26,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2022-07-12 19:24:26,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2022-07-12 19:24:26,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2022-07-12 19:24:26,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2022-07-12 19:24:26,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2022-07-12 19:24:26,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2022-07-12 19:24:26,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (41 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (40 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (39 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (38 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (37 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (36 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (35 of 59 remaining) [2022-07-12 19:24:26,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (34 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (33 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE (32 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE (31 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE (30 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE (29 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE (28 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (27 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (26 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (25 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (24 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (23 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (22 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (21 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (20 of 59 remaining) [2022-07-12 19:24:26,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (19 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (18 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (17 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (16 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (15 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (14 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (13 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (12 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (11 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (10 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (9 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (8 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (7 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (6 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (5 of 59 remaining) [2022-07-12 19:24:26,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (4 of 59 remaining) [2022-07-12 19:24:26,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (3 of 59 remaining) [2022-07-12 19:24:26,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (2 of 59 remaining) [2022-07-12 19:24:26,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (1 of 59 remaining) [2022-07-12 19:24:26,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (0 of 59 remaining) [2022-07-12 19:24:26,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-12 19:24:26,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:24:26,285 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:24:26,288 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 19:24:26,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:24:26 BoogieIcfgContainer [2022-07-12 19:24:26,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 19:24:26,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 19:24:26,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 19:24:26,330 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 19:24:26,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:22:37" (3/4) ... [2022-07-12 19:24:26,332 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 19:24:26,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 19:24:26,332 INFO L158 Benchmark]: Toolchain (without parser) took 109754.24ms. Allocated memory was 62.9MB in the beginning and 98.6MB in the end (delta: 35.7MB). Free memory was 42.5MB in the beginning and 60.6MB in the end (delta: -18.0MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-07-12 19:24:26,332 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 45.0MB in the beginning and 44.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:24:26,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.86ms. Allocated memory is still 62.9MB. Free memory was 42.3MB in the beginning and 39.7MB in the end (delta: 2.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 19:24:26,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.35ms. Allocated memory is still 62.9MB. Free memory was 39.7MB in the beginning and 37.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:24:26,333 INFO L158 Benchmark]: Boogie Preprocessor took 29.43ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 35.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:24:26,333 INFO L158 Benchmark]: RCFGBuilder took 425.65ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 35.6MB in the beginning and 54.5MB in the end (delta: -18.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 19:24:26,333 INFO L158 Benchmark]: TraceAbstraction took 108872.58ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 54.1MB in the beginning and 60.6MB in the end (delta: -6.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-07-12 19:24:26,333 INFO L158 Benchmark]: Witness Printer took 2.07ms. Allocated memory is still 98.6MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:24:26,334 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 45.0MB in the beginning and 44.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.86ms. Allocated memory is still 62.9MB. Free memory was 42.3MB in the beginning and 39.7MB in the end (delta: 2.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.35ms. Allocated memory is still 62.9MB. Free memory was 39.7MB in the beginning and 37.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.43ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 35.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.65ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 35.6MB in the beginning and 54.5MB in the end (delta: -18.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 108872.58ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 54.1MB in the beginning and 60.6MB in the end (delta: -6.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Witness Printer took 2.07ms. Allocated memory is still 98.6MB. Free memory is still 60.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 616. Possible FailurePath: [L617] const int len = 3; [L618] CALL, EXPR dll_circular_create(len) [L564] DLL last = (DLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == last) VAL [\old(len)=3, last={1:0}, len=3] [L568] last->next = last VAL [\old(len)=3, last={1:0}, len=3] [L569] last->prev = last VAL [\old(len)=3, last={1:0}, len=3] [L570] DLL head = last; VAL [\old(len)=3, head={1:0}, last={1:0}, len=3] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={1:0}, last={1:0}, len=3, new_head={3:0}] [L576] new_head->next = head VAL [\old(len)=3, head={1:0}, last={1:0}, len=3, new_head={3:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={1:0}, last={1:0}, len=3, new_head={3:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={3:0}, last={1:0}, len=2, new_head={3:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={3:0}, last={1:0}, len=2, new_head={11:0}] [L576] new_head->next = head VAL [\old(len)=3, head={3:0}, last={1:0}, len=2, new_head={11:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={3:0}, last={1:0}, len=2, new_head={11:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={11:0}, last={1:0}, len=1, new_head={11:0}] [L571] COND FALSE !(len > 1) VAL [\old(len)=3, head={11:0}, last={1:0}, len=1, new_head={11:0}] [L581] last->next = head VAL [\old(len)=3, head={11:0}, last={1:0}, len=1, new_head={11:0}] [L582] head->prev = last VAL [\old(len)=3, head={11:0}, last={1:0}, len=1, new_head={11:0}] [L583] return head; VAL [\old(len)=3, \result={11:0}, head={11:0}, last={1:0}, len=1, new_head={11:0}] [L618] RET, EXPR dll_circular_create(len) [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) [L586] EXPR head->prev VAL [head={11:0}, head={11:0}, head->prev={1:0}] [L586] DLL pred = head->prev; [L587] EXPR head->next VAL [head={11:0}, head={11:0}, head->next={3:0}, pred={1:0}] [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND FALSE !(__VERIFIER_nondet_int()) [L607] free(pred) VAL [head={11:0}, head={11:0}, pred={1:0}, succ={3:0}] [L607] free(pred) VAL [head={11:0}, head={11:0}, pred={1:0}, succ={3:0}] [L607] free(pred) [L608] COND FALSE !(__VERIFIER_nondet_int()) [L612] free(head) VAL [head={11:0}, head={11:0}, pred={1:0}, succ={3:0}] [L612] free(head) VAL [head={11:0}, head={11:0}, pred={1:0}, succ={3:0}] [L612] free(head) [L619] RET _destroy_in_nondeterministic_order(head) [L620] head = ((void *)0) [L621] return 0; VAL [\result=0, head={0:0}, len=3] - 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: -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: -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: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 134 locations, 59 error locations. Started 1 CEGAR loops. OverallTime: 108.8s, OverallIterations: 30, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5014 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5014 mSDsluCounter, 9057 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3426 IncrementalHoareTripleChecker+Unchecked, 6748 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5525 IncrementalHoareTripleChecker+Invalid, 9284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 2309 mSDtfsCounter, 5525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1147 GetRequests, 692 SyntacticMatches, 30 SemanticMatches, 425 ConstructedPredicates, 17 IntricatePredicates, 2 DeprecatedPredicates, 2100 ImplicationChecksByTransitivity, 89.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=0, InterpolantAutomatonStates: 266, 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, 29 MinimizatonAttempts, 67 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 88.5s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1009 ConstructedInterpolants, 240 QuantifiedInterpolants, 11381 SizeOfPredicates, 277 NumberOfNonLiveVariables, 3654 ConjunctsInSsa, 473 ConjunctsInUnsatCore, 42 InterpolantComputations, 16 PerfectInterpolantSequences, 97/243 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 could not prove your program: unable to determine feasibility of some traces [2022-07-12 19:24:26,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample