./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 791161d1 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-?-791161d [2022-07-23 06:39:32,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:39:32,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:39:32,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:39:32,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:39:32,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:39:32,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:39:32,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:39:32,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:39:32,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:39:32,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:39:32,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:39:32,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:39:32,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:39:32,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:39:32,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:39:32,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:39:32,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:39:32,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:39:32,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:39:32,222 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:39:32,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:39:32,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:39:32,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:39:32,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:39:32,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:39:32,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:39:32,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:39:32,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:39:32,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:39:32,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:39:32,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:39:32,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:39:32,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:39:32,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:39:32,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:39:32,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:39:32,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:39:32,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:39:32,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:39:32,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:39:32,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:39:32,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:39:32,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:39:32,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:39:32,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:39:32,255 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:39:32,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:39:32,256 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:39:32,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:39:32,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:39:32,256 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:39:32,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:39:32,257 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:39:32,257 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:39:32,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:39:32,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:39:32,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:39:32,258 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:39:32,258 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:39:32,258 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:39:32,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:39:32,259 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:39:32,259 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:39:32,259 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:39:32,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:39:32,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:39:32,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:39:32,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:39:32,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:39:32,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:39:32,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:39:32,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:39:32,261 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-23 06:39:32,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:39:32,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:39:32,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:39:32,482 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:39:32,482 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:39:32,483 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-23 06:39:32,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf6b6844/a3c757bf5f8849abafc82cc69f14f880/FLAGbe5530f51 [2022-07-23 06:39:32,872 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:39:32,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2022-07-23 06:39:32,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf6b6844/a3c757bf5f8849abafc82cc69f14f880/FLAGbe5530f51 [2022-07-23 06:39:33,278 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf6b6844/a3c757bf5f8849abafc82cc69f14f880 [2022-07-23 06:39:33,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:39:33,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:39:33,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:39:33,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:39:33,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:39:33,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@840edfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33, skipping insertion in model container [2022-07-23 06:39:33,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:39:33,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:39:33,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:39:33,530 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:39:33,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:39:33,595 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:39:33,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33 WrapperNode [2022-07-23 06:39:33,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:39:33,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:39:33,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:39:33,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:39:33,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,642 INFO L137 Inliner]: procedures = 116, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2022-07-23 06:39:33,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:39:33,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:39:33,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:39:33,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:39:33,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:39:33,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:39:33,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:39:33,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:39:33,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (1/1) ... [2022-07-23 06:39:33,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:39:33,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:33,704 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-23 06:39:33,708 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-23 06:39:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-23 06:39:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-23 06:39:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:39:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:39:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:39:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:39:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:39:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:39:33,815 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:39:33,816 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:39:33,855 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-23 06:39:34,122 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:39:34,127 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:39:34,127 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 06:39:34,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:39:34 BoogieIcfgContainer [2022-07-23 06:39:34,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:39:34,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:39:34,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:39:34,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:39:34,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:39:33" (1/3) ... [2022-07-23 06:39:34,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688f0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:39:34, skipping insertion in model container [2022-07-23 06:39:34,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:39:33" (2/3) ... [2022-07-23 06:39:34,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688f0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:39:34, skipping insertion in model container [2022-07-23 06:39:34,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:39:34" (3/3) ... [2022-07-23 06:39:34,135 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2022-07-23 06:39:34,146 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:39:34,146 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2022-07-23 06:39:34,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:39:34,194 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@670ce4ec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ec7b8af [2022-07-23 06:39:34,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2022-07-23 06:39:34,198 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-23 06:39:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:39:34,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:34,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:39:34,210 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-23 06:39:34,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:34,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-07-23 06:39:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:34,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634990812] [2022-07-23 06:39:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:34,334 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-23 06:39:34,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:34,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634990812] [2022-07-23 06:39:34,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634990812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:34,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:34,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:39:34,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578114079] [2022-07-23 06:39:34,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:34,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:39:34,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:34,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:39:34,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:34,364 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-23 06:39:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:34,468 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-07-23 06:39:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:39:34,469 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-23 06:39:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:34,476 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:39:34,476 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:39:34,478 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-23 06:39:34,480 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-23 06:39:34,481 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-23 06:39:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:39:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-23 06:39:34,509 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-23 06:39:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-07-23 06:39:34,515 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 4 [2022-07-23 06:39:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:34,516 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-07-23 06:39:34,516 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-23 06:39:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-07-23 06:39:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:39:34,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:34,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:39:34,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:39:34,518 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-23 06:39:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-07-23 06:39:34,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:34,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454609659] [2022-07-23 06:39:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:34,585 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-23 06:39:34,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:34,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454609659] [2022-07-23 06:39:34,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454609659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:34,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:34,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:39:34,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570109657] [2022-07-23 06:39:34,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:34,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:39:34,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:34,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:39:34,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:34,589 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-23 06:39:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:34,627 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-23 06:39:34,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:39:34,627 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-23 06:39:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:34,629 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:39:34,629 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:39:34,630 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-23 06:39:34,632 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-23 06:39:34,633 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-23 06:39:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:39:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-23 06:39:34,640 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-23 06:39:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-23 06:39:34,641 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 4 [2022-07-23 06:39:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:34,642 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-23 06:39:34,643 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-23 06:39:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-23 06:39:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:39:34,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:34,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:34,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:39:34,646 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-23 06:39:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:34,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2022-07-23 06:39:34,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:34,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751207345] [2022-07-23 06:39:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:34,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:34,692 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-23 06:39:34,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:34,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751207345] [2022-07-23 06:39:34,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751207345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:34,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:34,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:39:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554587698] [2022-07-23 06:39:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:34,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:39:34,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:34,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:39:34,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:34,696 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-23 06:39:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:34,708 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-07-23 06:39:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:39:34,709 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-23 06:39:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:34,710 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:39:34,711 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:39:34,711 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-23 06:39:34,712 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-23 06:39:34,714 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-23 06:39:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:39:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2022-07-23 06:39:34,721 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-23 06:39:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2022-07-23 06:39:34,721 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 9 [2022-07-23 06:39:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:34,721 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2022-07-23 06:39:34,722 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-23 06:39:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-07-23 06:39:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:39:34,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:34,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:34,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:39:34,723 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-23 06:39:34,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-07-23 06:39:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:34,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092753094] [2022-07-23 06:39:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:34,758 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-23 06:39:34,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:34,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092753094] [2022-07-23 06:39:34,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092753094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:34,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:34,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:39:34,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518019405] [2022-07-23 06:39:34,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:34,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:39:34,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:34,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:39:34,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:34,760 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-23 06:39:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:34,809 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-23 06:39:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:39:34,810 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-23 06:39:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:34,811 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:39:34,811 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:39:34,811 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-23 06:39:34,817 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-23 06:39:34,819 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-23 06:39:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:39:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-23 06:39:34,841 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-23 06:39:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-23 06:39:34,842 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 9 [2022-07-23 06:39:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:34,842 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-23 06:39:34,842 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-23 06:39:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-23 06:39:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:39:34,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:34,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:34,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:39:34,842 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-23 06:39:34,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-07-23 06:39:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:34,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797173657] [2022-07-23 06:39:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:34,876 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-23 06:39:34,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:34,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797173657] [2022-07-23 06:39:34,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797173657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:34,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:34,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:39:34,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133392123] [2022-07-23 06:39:34,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:34,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:39:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:34,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:39:34,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:39:34,879 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-23 06:39:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:34,896 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-07-23 06:39:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:39:34,897 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-23 06:39:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:34,898 INFO L225 Difference]: With dead ends: 120 [2022-07-23 06:39:34,898 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 06:39:34,898 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-23 06:39:34,899 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-23 06:39:34,899 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-23 06:39:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 06:39:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-23 06:39:34,917 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-23 06:39:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-07-23 06:39:34,918 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 9 [2022-07-23 06:39:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:34,919 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-07-23 06:39:34,922 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-23 06:39:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-07-23 06:39:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:39:34,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:34,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:34,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:39:34,923 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-23 06:39:34,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:34,924 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2022-07-23 06:39:34,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:34,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132573332] [2022-07-23 06:39:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:34,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:34,990 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-23 06:39:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:34,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132573332] [2022-07-23 06:39:34,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132573332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:34,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:34,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:39:34,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939842125] [2022-07-23 06:39:34,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:34,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:39:34,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:34,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:39:34,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:39:34,992 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-23 06:39:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:35,089 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-23 06:39:35,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:39:35,090 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-23 06:39:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:35,090 INFO L225 Difference]: With dead ends: 124 [2022-07-23 06:39:35,091 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:39:35,091 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-23 06:39:35,092 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-23 06:39:35,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-23 06:39:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:39:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-23 06:39:35,097 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-23 06:39:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2022-07-23 06:39:35,098 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 10 [2022-07-23 06:39:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:35,098 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2022-07-23 06:39:35,098 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-23 06:39:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2022-07-23 06:39:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:39:35,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:35,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:35,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 06:39:35,099 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-23 06:39:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2022-07-23 06:39:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:35,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457347007] [2022-07-23 06:39:35,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:35,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:35,200 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-23 06:39:35,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:35,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457347007] [2022-07-23 06:39:35,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457347007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:35,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:35,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:39:35,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319236625] [2022-07-23 06:39:35,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:35,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:39:35,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:35,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:39:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:39:35,203 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-23 06:39:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:35,292 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-23 06:39:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:39:35,292 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-23 06:39:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:35,293 INFO L225 Difference]: With dead ends: 124 [2022-07-23 06:39:35,293 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:39:35,293 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-23 06:39:35,294 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-23 06:39:35,294 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-23 06:39:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:39:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-23 06:39:35,296 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-23 06:39:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2022-07-23 06:39:35,297 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 10 [2022-07-23 06:39:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:35,297 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2022-07-23 06:39:35,297 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-23 06:39:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2022-07-23 06:39:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:39:35,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:35,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:35,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 06:39:35,298 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-23 06:39:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2022-07-23 06:39:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:35,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104962254] [2022-07-23 06:39:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:35,333 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-23 06:39:35,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:35,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104962254] [2022-07-23 06:39:35,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104962254] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:35,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207669945] [2022-07-23 06:39:35,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:35,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:35,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:35,344 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-23 06:39:35,345 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-23 06:39:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:35,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:39:35,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:35,467 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-23 06:39:35,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:35,503 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-23 06:39:35,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207669945] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:35,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:35,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-23 06:39:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335686969] [2022-07-23 06:39:35,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:35,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:39:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:35,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:39:35,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:39:35,505 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-23 06:39:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:35,516 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-07-23 06:39:35,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:39:35,517 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-23 06:39:35,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:35,517 INFO L225 Difference]: With dead ends: 125 [2022-07-23 06:39:35,517 INFO L226 Difference]: Without dead ends: 125 [2022-07-23 06:39:35,517 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-23 06:39:35,518 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-23 06:39:35,518 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-23 06:39:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-23 06:39:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-23 06:39:35,520 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-23 06:39:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2022-07-23 06:39:35,520 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 14 [2022-07-23 06:39:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:35,520 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2022-07-23 06:39:35,521 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-23 06:39:35,521 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-07-23 06:39:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:39:35,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:35,521 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:35,541 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-23 06:39:35,735 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-23 06:39:35,736 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-23 06:39:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:35,736 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2022-07-23 06:39:35,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:35,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071538271] [2022-07-23 06:39:35,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:35,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:35,774 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-23 06:39:35,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:35,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071538271] [2022-07-23 06:39:35,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071538271] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:35,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938801662] [2022-07-23 06:39:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:35,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:35,778 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-23 06:39:35,779 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-23 06:39:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:35,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:39:35,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:35,891 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-23 06:39:35,937 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:39:35,937 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-23 06:39:35,946 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-23 06:39:35,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:36,041 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-23 06:39:36,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938801662] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:36,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:36,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-23 06:39:36,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888053929] [2022-07-23 06:39:36,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:36,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:39:36,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:36,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:39:36,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:39:36,043 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-23 06:39:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:36,117 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2022-07-23 06:39:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:39:36,118 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-23 06:39:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:36,118 INFO L225 Difference]: With dead ends: 123 [2022-07-23 06:39:36,118 INFO L226 Difference]: Without dead ends: 123 [2022-07-23 06:39:36,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:39:36,119 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:36,119 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.1s Time] [2022-07-23 06:39:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-23 06:39:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-23 06:39:36,121 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-23 06:39:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2022-07-23 06:39:36,121 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 15 [2022-07-23 06:39:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:36,122 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2022-07-23 06:39:36,122 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-23 06:39:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2022-07-23 06:39:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:39:36,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:36,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:36,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-23 06:39:36,335 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-23 06:39:36,337 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-23 06:39:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2022-07-23 06:39:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:36,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754441165] [2022-07-23 06:39:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:36,410 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-23 06:39:36,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:36,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754441165] [2022-07-23 06:39:36,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754441165] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:36,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68060129] [2022-07-23 06:39:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:36,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:36,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:36,412 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-23 06:39:36,413 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-23 06:39:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:36,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 06:39:36,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:36,502 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-23 06:39:36,506 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-23 06:39:36,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:36,559 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-23 06:39:36,568 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:39:36,568 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-23 06:39:36,586 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-23 06:39:36,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:40,848 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-23 06:39:40,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68060129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:40,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:40,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-07-23 06:39:40,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666937513] [2022-07-23 06:39:40,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:40,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:39:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:40,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:39:40,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:39:40,851 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-23 06:39:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:41,072 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-23 06:39:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:39:41,072 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-23 06:39:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:41,073 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:39:41,073 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:39:41,074 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-23 06:39:41,074 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-23 06:39:41,075 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-23 06:39:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:39:41,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-23 06:39:41,077 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-23 06:39:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-23 06:39:41,080 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 15 [2022-07-23 06:39:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:41,080 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-23 06:39:41,080 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-23 06:39:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-23 06:39:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:39:41,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:41,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:41,101 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-23 06:39:41,295 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-23 06:39:41,295 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-23 06:39:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:41,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2022-07-23 06:39:41,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:41,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371421504] [2022-07-23 06:39:41,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:41,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:41,348 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-23 06:39:41,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:41,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371421504] [2022-07-23 06:39:41,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371421504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:41,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:41,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:39:41,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056917758] [2022-07-23 06:39:41,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:41,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:39:41,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:41,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:39:41,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:39:41,350 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-23 06:39:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:41,452 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2022-07-23 06:39:41,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:39:41,452 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-23 06:39:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:41,453 INFO L225 Difference]: With dead ends: 118 [2022-07-23 06:39:41,453 INFO L226 Difference]: Without dead ends: 118 [2022-07-23 06:39:41,453 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-23 06:39:41,454 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-23 06:39:41,454 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-23 06:39:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-23 06:39:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-23 06:39:41,456 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-23 06:39:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2022-07-23 06:39:41,456 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 22 [2022-07-23 06:39:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:41,456 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2022-07-23 06:39:41,456 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-23 06:39:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2022-07-23 06:39:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:39:41,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:41,457 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:41,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:39:41,457 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-23 06:39:41,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:41,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2022-07-23 06:39:41,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:41,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647628484] [2022-07-23 06:39:41,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:41,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:41,532 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-23 06:39:41,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:41,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647628484] [2022-07-23 06:39:41,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647628484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:41,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:41,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:39:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039720382] [2022-07-23 06:39:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:41,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:39:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:41,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:39:41,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:39:41,534 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-23 06:39:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:41,617 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-07-23 06:39:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:39:41,617 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-23 06:39:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:41,618 INFO L225 Difference]: With dead ends: 111 [2022-07-23 06:39:41,618 INFO L226 Difference]: Without dead ends: 111 [2022-07-23 06:39:41,619 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-23 06:39:41,619 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-23 06:39:41,619 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-23 06:39:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-23 06:39:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-23 06:39:41,621 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-23 06:39:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2022-07-23 06:39:41,622 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 22 [2022-07-23 06:39:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:41,622 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2022-07-23 06:39:41,623 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-23 06:39:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2022-07-23 06:39:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:39:41,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:41,623 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-23 06:39:41,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 06:39:41,624 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-23 06:39:41,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2022-07-23 06:39:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:41,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360804745] [2022-07-23 06:39:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:41,690 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-23 06:39:41,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:41,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360804745] [2022-07-23 06:39:41,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360804745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:41,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:41,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:39:41,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842882883] [2022-07-23 06:39:41,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:41,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:39:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:41,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:39:41,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:39:41,694 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-23 06:39:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:41,788 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-07-23 06:39:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:39:41,788 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-23 06:39:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:41,789 INFO L225 Difference]: With dead ends: 106 [2022-07-23 06:39:41,789 INFO L226 Difference]: Without dead ends: 106 [2022-07-23 06:39:41,790 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-23 06:39:41,791 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 362 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-23 06:39:41,792 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-23 06:39:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-23 06:39:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-23 06:39:41,793 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-23 06:39:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2022-07-23 06:39:41,794 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 28 [2022-07-23 06:39:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:41,794 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2022-07-23 06:39:41,794 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-23 06:39:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-07-23 06:39:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:39:41,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:41,797 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-23 06:39:41,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 06:39:41,797 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-23 06:39:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2022-07-23 06:39:41,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:41,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047910389] [2022-07-23 06:39:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:41,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:41,927 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-23 06:39:41,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:41,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047910389] [2022-07-23 06:39:41,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047910389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:41,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:41,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:39:41,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548814462] [2022-07-23 06:39:41,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:41,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:39:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:41,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:39:41,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:39:41,929 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-23 06:39:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:42,074 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-07-23 06:39:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:39:42,075 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-23 06:39:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:42,075 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:39:42,075 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 06:39:42,075 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-23 06:39:42,076 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-23 06:39:42,076 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-23 06:39:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 06:39:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-23 06:39:42,077 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-23 06:39:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-07-23 06:39:42,077 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 28 [2022-07-23 06:39:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:42,077 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-07-23 06:39:42,078 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-23 06:39:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-07-23 06:39:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:39:42,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:42,078 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-23 06:39:42,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 06:39:42,078 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-23 06:39:42,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2022-07-23 06:39:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:42,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789946284] [2022-07-23 06:39:42,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:42,258 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-23 06:39:42,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:42,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789946284] [2022-07-23 06:39:42,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789946284] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:42,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945738073] [2022-07-23 06:39:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:42,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:42,268 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-23 06:39:42,269 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-23 06:39:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:42,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-23 06:39:42,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:42,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:39:42,491 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:39:42,491 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-23 06:39:42,527 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-23 06:39:42,560 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-23 06:39:42,627 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-23 06:39:42,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:42,652 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-23 06:39:42,745 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:42,745 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-23 06:39:42,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-23 06:39:42,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:42,766 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-23 06:39:42,776 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-23 06:39:42,780 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-23 06:39:42,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:42,785 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-23 06:39:42,794 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-23 06:39:42,797 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-23 06:39:42,799 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-23 06:39:42,965 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:39:42,965 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-23 06:39:42,971 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-23 06:39:42,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945738073] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:42,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:42,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 35 [2022-07-23 06:39:42,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569178384] [2022-07-23 06:39:42,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:42,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 06:39:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:42,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 06:39:42,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=952, Unknown=3, NotChecked=192, Total=1260 [2022-07-23 06:39:42,973 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-23 06:39:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:43,548 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2022-07-23 06:39:43,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:39:43,549 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-23 06:39:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:43,549 INFO L225 Difference]: With dead ends: 193 [2022-07-23 06:39:43,549 INFO L226 Difference]: Without dead ends: 193 [2022-07-23 06:39:43,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=1573, Unknown=3, NotChecked=252, Total=2070 [2022-07-23 06:39:43,550 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-23 06:39:43,551 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-23 06:39:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-23 06:39:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2022-07-23 06:39:43,552 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-23 06:39:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2022-07-23 06:39:43,553 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 28 [2022-07-23 06:39:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:43,553 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2022-07-23 06:39:43,553 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-23 06:39:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2022-07-23 06:39:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:39:43,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:43,553 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-23 06:39:43,577 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-23 06:39:43,759 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-23 06:39:43,759 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-23 06:39:43,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2022-07-23 06:39:43,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:43,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484331175] [2022-07-23 06:39:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:43,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:43,875 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-23 06:39:43,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:43,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484331175] [2022-07-23 06:39:43,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484331175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:43,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:43,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:39:43,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3548530] [2022-07-23 06:39:43,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:43,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:39:43,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:39:43,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:39:43,878 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-23 06:39:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:44,131 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2022-07-23 06:39:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:39:44,131 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-23 06:39:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:44,132 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:39:44,132 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:39:44,132 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-23 06:39:44,133 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:44,133 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.2s Time] [2022-07-23 06:39:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:39:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-23 06:39:44,135 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-23 06:39:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2022-07-23 06:39:44,135 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 29 [2022-07-23 06:39:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:44,135 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2022-07-23 06:39:44,136 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-23 06:39:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2022-07-23 06:39:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:39:44,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:44,136 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-23 06:39:44,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 06:39:44,137 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-23 06:39:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2022-07-23 06:39:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:44,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293643478] [2022-07-23 06:39:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:44,353 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-23 06:39:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:44,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293643478] [2022-07-23 06:39:44,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293643478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:44,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709593653] [2022-07-23 06:39:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:44,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:44,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:44,355 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-23 06:39:44,356 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-23 06:39:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:44,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-23 06:39:44,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:44,442 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-23 06:39:44,474 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:39:44,474 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-23 06:39:44,489 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-23 06:39:44,519 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-23 06:39:44,607 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-23 06:39:44,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:44,652 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-23 06:39:44,743 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-23 06:39:44,753 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-23 06:39:44,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:44,781 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-23 06:39:44,788 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-23 06:39:44,792 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-23 06:39:44,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:44,799 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-23 06:39:44,801 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-23 06:39:44,804 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-23 06:39:44,807 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-23 06:39:44,985 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-07-23 06:39:44,986 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-23 06:39:45,017 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-23 06:39:45,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709593653] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:45,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:45,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-07-23 06:39:45,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709329911] [2022-07-23 06:39:45,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:45,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 06:39:45,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:45,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 06:39:45,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=581, Unknown=3, NotChecked=150, Total=812 [2022-07-23 06:39:45,019 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-23 06:39:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:45,659 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2022-07-23 06:39:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:39:45,660 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-23 06:39:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:45,660 INFO L225 Difference]: With dead ends: 175 [2022-07-23 06:39:45,660 INFO L226 Difference]: Without dead ends: 175 [2022-07-23 06:39:45,661 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-23 06:39:45,661 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-23 06:39:45,661 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-23 06:39:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-23 06:39:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2022-07-23 06:39:45,663 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-23 06:39:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2022-07-23 06:39:45,663 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 29 [2022-07-23 06:39:45,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:45,664 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2022-07-23 06:39:45,664 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-23 06:39:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2022-07-23 06:39:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:39:45,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:45,664 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-23 06:39:45,693 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-23 06:39:45,865 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-23 06:39:45,865 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-23 06:39:45,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2022-07-23 06:39:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:45,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190609975] [2022-07-23 06:39:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:45,975 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-23 06:39:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:45,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190609975] [2022-07-23 06:39:45,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190609975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:39:45,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:39:45,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:39:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325921081] [2022-07-23 06:39:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:39:45,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:39:45,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:39:45,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:39:45,978 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-23 06:39:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:46,244 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-07-23 06:39:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:39:46,251 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-23 06:39:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:46,252 INFO L225 Difference]: With dead ends: 132 [2022-07-23 06:39:46,252 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 06:39:46,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:39:46,253 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:46,253 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.2s Time] [2022-07-23 06:39:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 06:39:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-23 06:39:46,255 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-23 06:39:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-07-23 06:39:46,256 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 30 [2022-07-23 06:39:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:46,256 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-07-23 06:39:46,256 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-23 06:39:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-07-23 06:39:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:39:46,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:46,257 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-23 06:39:46,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 06:39:46,257 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-23 06:39:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2022-07-23 06:39:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:46,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674233735] [2022-07-23 06:39:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:46,426 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-23 06:39:46,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:46,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674233735] [2022-07-23 06:39:46,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674233735] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:46,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89661802] [2022-07-23 06:39:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:46,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:46,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:46,429 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-23 06:39:46,455 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-23 06:39:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:46,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-23 06:39:46,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:46,528 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-23 06:39:46,550 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:46,550 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-23 06:39:46,572 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:39:46,572 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-23 06:39:46,582 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-23 06:39:46,596 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:46,597 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-23 06:39:46,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 06:39:46,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:46,676 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-23 06:39:46,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:46,781 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-23 06:39:46,799 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-23 06:39:46,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:46,896 INFO L356 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2022-07-23 06:39:46,896 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-23 06:39:46,903 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-23 06:39:46,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:46,908 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-23 06:39:46,911 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-23 06:39:46,917 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-23 06:39:46,920 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-23 06:39:47,076 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-23 06:39:47,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89661802] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:47,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:47,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 28 [2022-07-23 06:39:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724081473] [2022-07-23 06:39:47,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:47,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 06:39:47,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:47,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 06:39:47,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=673, Unknown=2, NotChecked=52, Total=812 [2022-07-23 06:39:47,079 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-23 06:39:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:47,684 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2022-07-23 06:39:47,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:39:47,685 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-23 06:39:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:47,685 INFO L225 Difference]: With dead ends: 131 [2022-07-23 06:39:47,685 INFO L226 Difference]: Without dead ends: 131 [2022-07-23 06:39:47,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=1395, Unknown=2, NotChecked=78, Total=1722 [2022-07-23 06:39:47,686 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-23 06:39:47,686 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-23 06:39:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-23 06:39:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-23 06:39:47,689 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-23 06:39:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2022-07-23 06:39:47,689 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 30 [2022-07-23 06:39:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:47,689 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2022-07-23 06:39:47,689 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-23 06:39:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2022-07-23 06:39:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:39:47,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:47,690 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-23 06:39:47,706 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-23 06:39:47,899 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-23 06:39:47,899 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-23 06:39:47,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:47,900 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2022-07-23 06:39:47,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:47,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131445175] [2022-07-23 06:39:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:48,082 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-23 06:39:48,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:48,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131445175] [2022-07-23 06:39:48,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131445175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:48,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073856229] [2022-07-23 06:39:48,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:48,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:48,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:48,083 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-23 06:39:48,084 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-23 06:39:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:48,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-23 06:39:48,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:48,197 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:39:48,197 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-23 06:39:48,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, 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-23 06:39:48,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:48,320 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-23 06:39:48,457 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-23 06:39:48,461 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-23 06:39:48,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:48,593 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-23 06:39:48,595 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-23 06:39:48,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-23 06:39:48,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:48,613 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-23 06:39:48,661 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:39:48,661 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-23 06:39:48,665 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-23 06:39:48,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073856229] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:48,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:48,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2022-07-23 06:39:48,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551026369] [2022-07-23 06:39:48,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:48,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-23 06:39:48,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:48,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-23 06:39:48,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2022-07-23 06:39:48,667 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-23 06:39:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:49,232 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-07-23 06:39:49,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:39:49,232 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-23 06:39:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:49,233 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:39:49,233 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:39:49,233 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-23 06:39:49,234 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-23 06:39:49,234 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-23 06:39:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:39:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-23 06:39:49,236 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-23 06:39:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2022-07-23 06:39:49,236 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 33 [2022-07-23 06:39:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:49,236 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2022-07-23 06:39:49,237 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-23 06:39:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2022-07-23 06:39:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:39:49,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:49,237 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-23 06:39:49,256 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-23 06:39:49,451 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-23 06:39:49,451 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-23 06:39:49,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:49,452 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2022-07-23 06:39:49,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:39:49,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333920717] [2022-07-23 06:39:49,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:49,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:39:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:49,646 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-23 06:39:49,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:39:49,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333920717] [2022-07-23 06:39:49,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333920717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:49,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902327271] [2022-07-23 06:39:49,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:49,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:39:49,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:39:49,648 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-23 06:39:49,649 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-23 06:39:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:49,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-23 06:39:49,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:49,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-23 06:39:49,782 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:49,782 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-23 06:39:49,831 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:39:49,831 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-23 06:39:49,842 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-23 06:39:49,856 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:49,856 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-23 06:39:49,893 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-23 06:39:49,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:49,926 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-23 06:39:49,992 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:49,993 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-23 06:39:50,103 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-23 06:39:50,107 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-23 06:39:50,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:50,283 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-23 06:39:50,300 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-23 06:39:50,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:50,312 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-23 06:39:50,346 WARN L833 $PredicateComparison]: unable to prove that (and (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|)))) (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-23 06:39:50,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:50,353 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-23 06:39:50,355 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-23 06:39:50,358 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-23 06:39:50,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:50,370 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-23 06:39:50,384 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-23 06:39:50,418 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:39:50,418 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-23 06:39:50,439 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-23 06:39:50,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902327271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:50,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:39:50,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2022-07-23 06:39:50,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409539944] [2022-07-23 06:39:50,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:50,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 06:39:50,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:39:50,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 06:39:50,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=793, Unknown=3, NotChecked=174, Total=1056 [2022-07-23 06:39:50,442 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-23 06:39:53,881 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-23 06:40:00,060 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 68 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:40:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:00,480 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-07-23 06:40:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:40:00,480 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-23 06:40:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:00,481 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:40:00,481 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:40:00,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=235, Invalid=1499, Unknown=4, NotChecked=332, Total=2070 [2022-07-23 06:40:00,482 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-23 06:40:00,482 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-23 06:40:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:40:00,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-23 06:40:00,484 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-23 06:40:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2022-07-23 06:40:00,484 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 33 [2022-07-23 06:40:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:00,484 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2022-07-23 06:40:00,484 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-23 06:40:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-07-23 06:40:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:40:00,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:00,485 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-23 06:40:00,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:40:00,685 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-23 06:40:00,685 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-23 06:40:00,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:00,686 INFO L85 PathProgramCache]: Analyzing trace with hash -726129858, now seen corresponding path program 2 times [2022-07-23 06:40:00,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:00,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465254349] [2022-07-23 06:40:00,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:00,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:00,735 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-23 06:40:00,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:00,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465254349] [2022-07-23 06:40:00,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465254349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:00,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120783904] [2022-07-23 06:40:00,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:40:00,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:00,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:00,737 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-23 06:40:00,738 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-23 06:40:00,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:40:00,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:40:00,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:40:00,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:00,908 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-23 06:40:00,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:00,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120783904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:00,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:40:00,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-23 06:40:00,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111636744] [2022-07-23 06:40:00,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:00,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:40:00,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:00,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:40:00,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:40:00,909 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-23 06:40:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:00,917 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-07-23 06:40:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:40:00,917 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-23 06:40:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:00,918 INFO L225 Difference]: With dead ends: 84 [2022-07-23 06:40:00,918 INFO L226 Difference]: Without dead ends: 84 [2022-07-23 06:40:00,919 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-23 06:40:00,919 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-23 06:40:00,919 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-23 06:40:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-23 06:40:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-23 06:40:00,921 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-23 06:40:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-07-23 06:40:00,921 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 33 [2022-07-23 06:40:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:00,921 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-07-23 06:40:00,921 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-23 06:40:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-07-23 06:40:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:40:00,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:00,922 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-23 06:40:00,942 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-23 06:40:01,127 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-23 06:40:01,127 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-23 06:40:01,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:01,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2022-07-23 06:40:01,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:01,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387829196] [2022-07-23 06:40:01,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:01,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:01,305 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-23 06:40:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:01,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387829196] [2022-07-23 06:40:01,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387829196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:01,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406722237] [2022-07-23 06:40:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:01,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:01,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:01,307 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-23 06:40:01,310 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-23 06:40:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:01,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-23 06:40:01,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:01,426 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:40:01,427 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-23 06:40:01,464 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-23 06:40:01,504 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:01,504 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-23 06:40:01,596 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:40:01,597 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-23 06:40:01,632 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-23 06:40:01,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:01,745 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-23 06:40:01,775 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-23 06:40:01,777 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-23 06:40:01,822 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:40:01,823 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-23 06:40:01,827 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-23 06:40:01,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406722237] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:01,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:01,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-07-23 06:40:01,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56868750] [2022-07-23 06:40:01,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:01,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-23 06:40:01,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:01,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-23 06:40:01,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2022-07-23 06:40:01,828 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-23 06:40:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:02,216 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-07-23 06:40:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:40:02,216 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-23 06:40:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:02,217 INFO L225 Difference]: With dead ends: 82 [2022-07-23 06:40:02,217 INFO L226 Difference]: Without dead ends: 82 [2022-07-23 06:40:02,217 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-23 06:40:02,218 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 445 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-23 06:40:02,218 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-23 06:40:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-23 06:40:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-23 06:40:02,219 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-23 06:40:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-07-23 06:40:02,220 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 34 [2022-07-23 06:40:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:02,220 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-07-23 06:40:02,220 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-23 06:40:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-07-23 06:40:02,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:40:02,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:02,221 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-23 06:40:02,239 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-23 06:40:02,431 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-23 06:40:02,431 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-23 06:40:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2022-07-23 06:40:02,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:02,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113814793] [2022-07-23 06:40:02,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:02,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:02,761 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-23 06:40:02,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:02,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113814793] [2022-07-23 06:40:02,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113814793] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:02,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72219483] [2022-07-23 06:40:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:02,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:02,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:02,763 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-23 06:40:02,765 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-23 06:40:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:02,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 06:40:02,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:02,877 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-23 06:40:02,904 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:40:02,904 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-23 06:40:02,964 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:40:02,964 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-23 06:40:02,995 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-23 06:40:03,028 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:03,029 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-23 06:40:03,098 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-23 06:40:03,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:03,130 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-23 06:40:03,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:03,307 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-23 06:40:03,323 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-23 06:40:03,328 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-23 06:40:03,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:03,533 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-23 06:40:03,536 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-23 06:40:03,542 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-23 06:40:03,545 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-23 06:40:03,549 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:03,549 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-23 06:40:03,551 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-23 06:40:03,575 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-23 06:40:03,581 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-23 06:40: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 6 treesize of output 4 [2022-07-23 06:40:03,754 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-23 06:40:03,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72219483] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:03,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:03,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 46 [2022-07-23 06:40:03,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442341429] [2022-07-23 06:40:03,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:03,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-23 06:40:03,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:03,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-23 06:40:03,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1748, Unknown=3, NotChecked=258, Total=2162 [2022-07-23 06:40:03,755 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-23 06:40:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:04,845 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-07-23 06:40:04,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:40:04,846 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-23 06:40:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:04,846 INFO L225 Difference]: With dead ends: 79 [2022-07-23 06:40:04,846 INFO L226 Difference]: Without dead ends: 79 [2022-07-23 06:40:04,847 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-23 06:40:04,848 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-23 06:40:04,848 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-23 06:40:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-23 06:40:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-23 06:40:04,849 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-23 06:40:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-07-23 06:40:04,849 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 34 [2022-07-23 06:40:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:04,850 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-07-23 06:40:04,850 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-23 06:40:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-07-23 06:40:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:40:04,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:04,850 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-23 06:40:04,869 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-23 06:40:05,059 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-23 06:40:05,059 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-23 06:40:05,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2022-07-23 06:40:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:05,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838802928] [2022-07-23 06:40:05,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:05,231 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-23 06:40:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:05,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838802928] [2022-07-23 06:40:05,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838802928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:05,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913118504] [2022-07-23 06:40:05,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:05,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:05,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:05,233 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-23 06:40:05,233 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-23 06:40:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:05,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-23 06:40:05,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:05,330 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-23 06:40:05,349 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:05,349 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-23 06:40:05,367 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:40:05,367 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-23 06:40:05,376 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-23 06:40:05,408 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:05,409 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-23 06:40:05,441 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-23 06:40:05,452 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:40:05,452 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-23 06:40:05,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:05,533 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-23 06:40:05,614 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:40:05,614 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-23 06:40:05,646 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-23 06:40:05,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:05,770 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-23 06:40:06,084 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-23 06:40:06,088 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-23 06:40:06,092 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-23 06:40:06,096 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-23 06:40:06,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:06,100 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-23 06:40:06,102 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-23 06:40:06,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:06,110 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-23 06:40:06,113 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-23 06:40:06,116 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-23 06:40:06,229 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-23 06:40:06,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913118504] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:06,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:06,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 36 [2022-07-23 06:40:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814408320] [2022-07-23 06:40:06,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:06,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-23 06:40:06,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:06,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-23 06:40:06,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=956, Unknown=4, NotChecked=260, Total=1332 [2022-07-23 06:40:06,230 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-23 06:40:06,700 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-23 06:40:07,063 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-23 06:40:07,428 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-23 06:40:07,776 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-23 06:40:08,080 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-23 06:40:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:08,407 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-23 06:40:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:40:08,407 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-23 06:40:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:08,407 INFO L225 Difference]: With dead ends: 78 [2022-07-23 06:40:08,407 INFO L226 Difference]: Without dead ends: 78 [2022-07-23 06:40:08,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=239, Invalid=1594, Unknown=9, NotChecked=810, Total=2652 [2022-07-23 06:40:08,408 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-23 06:40:08,408 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-23 06:40:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-23 06:40:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-23 06:40:08,410 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-23 06:40:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-07-23 06:40:08,410 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 34 [2022-07-23 06:40:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:08,410 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-23 06:40:08,411 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-23 06:40:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-07-23 06:40:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:40:08,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:08,411 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-23 06:40:08,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-23 06:40:08,615 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-23 06:40:08,615 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-23 06:40:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2022-07-23 06:40:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:08,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615570189] [2022-07-23 06:40:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:09,010 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-23 06:40:09,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:40:09,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615570189] [2022-07-23 06:40:09,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615570189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:40:09,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761517216] [2022-07-23 06:40:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:09,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:40:09,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:09,012 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-23 06:40:09,013 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-23 06:40:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:09,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-23 06:40:09,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:09,118 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-23 06:40:09,142 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:40:09,142 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-23 06:40:09,210 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:40:09,211 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-23 06:40:09,247 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-23 06:40:09,278 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:09,279 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-23 06:40:09,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 32 treesize of output 30 [2022-07-23 06:40:09,388 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-23 06:40:09,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:09,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:09,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:09,556 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-23 06:40:09,882 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-23 06:40:09,921 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-23 06:40:09,925 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-23 06:40:09,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:11,219 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-23 06:40:16,355 INFO L356 Elim1Store]: treesize reduction 8, result has 85.5 percent of original size [2022-07-23 06:40:16,355 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-23 06:40:16,430 WARN L833 $PredicateComparison]: unable to prove that (and (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 ((.cse0 (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 .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))))))) (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|)))) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse1 (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 (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= 0 v_prenex_7)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (<= v_prenex_7 0)))))) is different from false [2022-07-23 06:40:16,439 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:16,440 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-23 06:40:16,442 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-23 06:40:16,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:16,452 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-23 06:40:16,460 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-23 06:40:16,473 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-23 06:40:16,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:16,721 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-23 06:40:16,726 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-23 06:40:16,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:16,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:16,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:16,738 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-23 06:40:16,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:16,748 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-23 06:40:16,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:40:16,760 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-23 06:40:16,807 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:40:16,808 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-23 06:40:17,014 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-23 06:40:17,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761517216] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:17,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:40:17,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 54 [2022-07-23 06:40:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418515791] [2022-07-23 06:40:17,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:17,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-23 06:40:17,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:40:17,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-23 06:40:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2570, Unknown=3, NotChecked=206, Total=2970 [2022-07-23 06:40:17,016 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-23 06:40:17,756 WARN L833 $PredicateComparison]: unable to prove that (and (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 ((.cse0 (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 .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))))))) (= |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) (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|)))) (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| (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 ((.cse1 (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 (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= 0 v_prenex_7)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (<= v_prenex_7 0)))))) is different from false [2022-07-23 06:40:18,687 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-23 06:40:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:19,688 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-07-23 06:40:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:40:19,688 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-23 06:40:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:19,689 INFO L225 Difference]: With dead ends: 79 [2022-07-23 06:40:19,689 INFO L226 Difference]: Without dead ends: 79 [2022-07-23 06:40:19,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=404, Invalid=4029, Unknown=5, NotChecked=532, Total=4970 [2022-07-23 06:40:19,690 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:19,692 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.4s Time] [2022-07-23 06:40:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-23 06:40:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-07-23 06:40:19,693 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-23 06:40:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-07-23 06:40:19,694 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 36 [2022-07-23 06:40:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:19,694 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-07-23 06:40:19,694 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-23 06:40:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-07-23 06:40:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:40:19,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:19,694 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-23 06:40:19,711 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-23 06:40:19,904 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-23 06:40:19,905 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-23 06:40:19,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1615055412, now seen corresponding path program 1 times [2022-07-23 06:40:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:40:19,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639224895] [2022-07-23 06:40:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:19,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:40:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 06:40:19,923 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 06:40:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 06:40:19,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 06:40:19,951 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 06:40:19,952 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2022-07-23 06:40:19,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2022-07-23 06:40:19,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2022-07-23 06:40:19,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2022-07-23 06:40:19,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2022-07-23 06:40:19,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2022-07-23 06:40:19,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2022-07-23 06:40:19,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2022-07-23 06:40:19,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2022-07-23 06:40:19,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2022-07-23 06:40:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2022-07-23 06:40:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2022-07-23 06:40:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2022-07-23 06:40:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2022-07-23 06:40:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2022-07-23 06:40:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2022-07-23 06:40:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2022-07-23 06:40:19,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (41 of 59 remaining) [2022-07-23 06:40:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (40 of 59 remaining) [2022-07-23 06:40:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (39 of 59 remaining) [2022-07-23 06:40:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (38 of 59 remaining) [2022-07-23 06:40:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (37 of 59 remaining) [2022-07-23 06:40:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (36 of 59 remaining) [2022-07-23 06:40:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (35 of 59 remaining) [2022-07-23 06:40:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (34 of 59 remaining) [2022-07-23 06:40:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (33 of 59 remaining) [2022-07-23 06:40:19,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE (32 of 59 remaining) [2022-07-23 06:40:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE (31 of 59 remaining) [2022-07-23 06:40:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE (30 of 59 remaining) [2022-07-23 06:40:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE (29 of 59 remaining) [2022-07-23 06:40:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE (28 of 59 remaining) [2022-07-23 06:40:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (27 of 59 remaining) [2022-07-23 06:40:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (26 of 59 remaining) [2022-07-23 06:40:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (25 of 59 remaining) [2022-07-23 06:40:19,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (24 of 59 remaining) [2022-07-23 06:40:19,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (23 of 59 remaining) [2022-07-23 06:40:19,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (22 of 59 remaining) [2022-07-23 06:40:19,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (21 of 59 remaining) [2022-07-23 06:40:19,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (20 of 59 remaining) [2022-07-23 06:40:19,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (19 of 59 remaining) [2022-07-23 06:40:19,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (18 of 59 remaining) [2022-07-23 06:40:19,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (17 of 59 remaining) [2022-07-23 06:40:19,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (16 of 59 remaining) [2022-07-23 06:40:19,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (15 of 59 remaining) [2022-07-23 06:40:19,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (14 of 59 remaining) [2022-07-23 06:40:19,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (13 of 59 remaining) [2022-07-23 06:40:19,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (12 of 59 remaining) [2022-07-23 06:40:19,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (11 of 59 remaining) [2022-07-23 06:40:19,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (10 of 59 remaining) [2022-07-23 06:40:19,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (9 of 59 remaining) [2022-07-23 06:40:19,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (8 of 59 remaining) [2022-07-23 06:40:19,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (7 of 59 remaining) [2022-07-23 06:40:19,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (6 of 59 remaining) [2022-07-23 06:40:19,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (5 of 59 remaining) [2022-07-23 06:40:19,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (4 of 59 remaining) [2022-07-23 06:40:19,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (3 of 59 remaining) [2022-07-23 06:40:19,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (2 of 59 remaining) [2022-07-23 06:40:19,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (1 of 59 remaining) [2022-07-23 06:40:19,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (0 of 59 remaining) [2022-07-23 06:40:19,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 06:40:19,967 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-23 06:40:19,970 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 06:40:20,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 06:40:20 BoogieIcfgContainer [2022-07-23 06:40:20,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 06:40:20,022 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 06:40:20,022 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 06:40:20,022 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 06:40:20,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:39:34" (3/4) ... [2022-07-23 06:40:20,025 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 06:40:20,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 06:40:20,025 INFO L158 Benchmark]: Toolchain (without parser) took 46744.19ms. Allocated memory was 86.0MB in the beginning and 172.0MB in the end (delta: 86.0MB). Free memory was 46.7MB in the beginning and 141.1MB in the end (delta: -94.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:40:20,025 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 86.0MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:40:20,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.11ms. Allocated memory was 86.0MB in the beginning and 117.4MB in the end (delta: 31.5MB). Free memory was 46.4MB in the beginning and 88.2MB in the end (delta: -41.8MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-07-23 06:40:20,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.63ms. Allocated memory is still 117.4MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:40:20,030 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 117.4MB. Free memory was 86.1MB in the beginning and 84.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:40:20,030 INFO L158 Benchmark]: RCFGBuilder took 451.20ms. Allocated memory is still 117.4MB. Free memory was 84.5MB in the beginning and 86.0MB in the end (delta: -1.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-23 06:40:20,031 INFO L158 Benchmark]: TraceAbstraction took 45891.41ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 85.0MB in the beginning and 142.2MB in the end (delta: -57.2MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2022-07-23 06:40:20,031 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 172.0MB. Free memory was 142.2MB in the beginning and 141.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:40:20,032 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.13ms. Allocated memory is still 86.0MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.11ms. Allocated memory was 86.0MB in the beginning and 117.4MB in the end (delta: 31.5MB). Free memory was 46.4MB in the beginning and 88.2MB in the end (delta: -41.8MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.63ms. Allocated memory is still 117.4MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 117.4MB. Free memory was 86.1MB in the beginning and 84.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 451.20ms. Allocated memory is still 117.4MB. Free memory was 84.5MB in the beginning and 86.0MB in the end (delta: -1.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 45891.41ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 85.0MB in the beginning and 142.2MB in the end (delta: -57.2MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 172.0MB. Free memory was 142.2MB in the beginning and 141.1MB in the end (delta: 1.0MB). 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: 45.8s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6654 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6654 mSDsluCounter, 10222 SdHoareTripleChecker+Invalid, 3.0s 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, 27 IntricatePredicates, 0 DeprecatedPredicates, 4488 ImplicationChecksByTransitivity, 31.5s 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 986 NumberOfCodeBlocks, 986 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1234 ConstructedInterpolants, 109 QuantifiedInterpolants, 13242 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-23 06:40:20,059 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-?-791161d [2022-07-23 06:40:21,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:40:21,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:40:21,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:40:21,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:40:21,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:40:21,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:40:21,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:40:21,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:40:21,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:40:21,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:40:21,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:40:21,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:40:21,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:40:21,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:40:21,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:40:21,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:40:21,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:40:21,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:40:21,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:40:21,730 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:40:21,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:40:21,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:40:21,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:40:21,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:40:21,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:40:21,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:40:21,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:40:21,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:40:21,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:40:21,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:40:21,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:40:21,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:40:21,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:40:21,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:40:21,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:40:21,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:40:21,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:40:21,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:40:21,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:40:21,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:40:21,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:40:21,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 06:40:21,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:40:21,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:40:21,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:40:21,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:40:21,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:40:21,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:40:21,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:40:21,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:40:21,780 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:40:21,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:40:21,781 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:40:21,781 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:40:21,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:40:21,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:40:21,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:40:21,782 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:40:21,782 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:40:21,782 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:40:21,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:40:21,783 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:40:21,783 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 06:40:21,783 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 06:40:21,783 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:40:21,783 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:40:21,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:40:21,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:40:21,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:40:21,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:40:21,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:40:21,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:40:21,784 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 06:40:21,785 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 06:40:21,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 06:40:21,785 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-23 06:40:22,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:40:22,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:40:22,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:40:22,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:40:22,058 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:40:22,059 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-23 06:40:22,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a4a9dc4/bf18279d34434a3da3cb933dd056ac8c/FLAG71cf86ba0 [2022-07-23 06:40:22,503 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:40:22,506 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2022-07-23 06:40:22,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a4a9dc4/bf18279d34434a3da3cb933dd056ac8c/FLAG71cf86ba0 [2022-07-23 06:40:22,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03a4a9dc4/bf18279d34434a3da3cb933dd056ac8c [2022-07-23 06:40:22,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:40:22,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:40:22,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:40:22,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:40:22,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:40:22,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f15f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22, skipping insertion in model container [2022-07-23 06:40:22,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:40:22,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:40:22,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:40:22,773 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:40:22,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:40:22,826 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:40:22,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22 WrapperNode [2022-07-23 06:40:22,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:40:22,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:40:22,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:40:22,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:40:22,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,865 INFO L137 Inliner]: procedures = 117, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2022-07-23 06:40:22,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:40:22,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:40:22,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:40:22,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:40:22,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:40:22,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:40:22,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:40:22,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:40:22,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (1/1) ... [2022-07-23 06:40:22,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:40:22,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:40:22,953 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-23 06:40:22,960 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-23 06:40:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-23 06:40:22,987 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-23 06:40:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:40:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:40:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:40:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:40:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:40:22,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:40:23,069 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:40:23,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:40:23,126 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-23 06:40:23,445 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:40:23,450 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:40:23,451 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 06:40:23,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:40:23 BoogieIcfgContainer [2022-07-23 06:40:23,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:40:23,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:40:23,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:40:23,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:40:23,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:40:22" (1/3) ... [2022-07-23 06:40:23,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae4008f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:40:23, skipping insertion in model container [2022-07-23 06:40:23,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:40:22" (2/3) ... [2022-07-23 06:40:23,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae4008f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:40:23, skipping insertion in model container [2022-07-23 06:40:23,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:40:23" (3/3) ... [2022-07-23 06:40:23,459 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2022-07-23 06:40:23,468 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:40:23,468 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2022-07-23 06:40:23,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:40:23,514 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@7a056490, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@caffdce [2022-07-23 06:40:23,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2022-07-23 06:40:23,523 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-23 06:40:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:40:23,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:23,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:40:23,529 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-23 06:40:23,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-07-23 06:40:23,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:23,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714029371] [2022-07-23 06:40:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:23,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:23,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:23,544 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-23 06:40:23,545 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-23 06:40:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:23,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:40:23,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:23,646 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-23 06:40:23,658 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-23 06:40:23,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:23,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:23,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714029371] [2022-07-23 06:40:23,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714029371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:23,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:23,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:40:23,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405767474] [2022-07-23 06:40:23,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:23,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:40:23,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:40:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:23,690 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-23 06:40:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:23,794 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-07-23 06:40:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:40:23,797 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-23 06:40:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:23,802 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:40:23,807 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:40:23,808 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-23 06:40:23,810 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-23 06:40:23,811 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-23 06:40:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:40:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-23 06:40:23,849 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-23 06:40:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-07-23 06:40:23,857 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 4 [2022-07-23 06:40:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:23,857 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-07-23 06:40:23,858 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-23 06:40:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-07-23 06:40:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:40:23,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:23,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:40:23,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 06:40:24,065 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-23 06:40:24,066 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-23 06:40:24,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-07-23 06:40:24,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:24,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394546264] [2022-07-23 06:40:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:24,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:24,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:24,068 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-23 06:40:24,070 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-23 06:40:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:24,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:40:24,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:24,126 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-23 06:40:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:40:24,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:24,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:24,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394546264] [2022-07-23 06:40:24,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394546264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:24,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:24,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:40:24,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648267779] [2022-07-23 06:40:24,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:24,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:40:24,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:40:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:24,152 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-23 06:40:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:24,219 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-23 06:40:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:40:24,223 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-23 06:40:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:24,224 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:40:24,224 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:40:24,224 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-23 06:40:24,225 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:24,225 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.1s Time] [2022-07-23 06:40:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:40:24,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-23 06:40:24,233 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-23 06:40:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-23 06:40:24,235 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 4 [2022-07-23 06:40:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:24,236 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-23 06:40:24,236 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-23 06:40:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-23 06:40:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:40:24,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:24,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:24,253 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-23 06:40:24,451 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-23 06:40:24,452 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-23 06:40:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2022-07-23 06:40:24,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:24,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999450459] [2022-07-23 06:40:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:24,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:24,456 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-23 06:40:24,457 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-23 06:40:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:24,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:40:24,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:24,528 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-23 06:40:24,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:24,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:24,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999450459] [2022-07-23 06:40:24,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999450459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:24,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:24,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:40:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165632635] [2022-07-23 06:40:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:24,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:40:24,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:24,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:40:24,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:24,534 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-23 06:40:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:24,551 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-07-23 06:40:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:40:24,552 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-23 06:40:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:24,553 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:40:24,553 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:40:24,554 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-23 06:40:24,555 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-23 06:40:24,556 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-23 06:40:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:40:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2022-07-23 06:40:24,565 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-23 06:40:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2022-07-23 06:40:24,566 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 9 [2022-07-23 06:40:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:24,566 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2022-07-23 06:40:24,566 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-23 06:40:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-07-23 06:40:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:40:24,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:24,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:24,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-23 06:40:24,773 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-23 06:40:24,774 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-23 06:40:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:24,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-07-23 06:40:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:24,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214415291] [2022-07-23 06:40:24,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:24,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:24,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:24,777 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-23 06:40:24,778 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-23 06:40:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:24,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:40:24,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:24,851 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-23 06:40:24,856 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-23 06:40:24,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:24,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:24,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214415291] [2022-07-23 06:40:24,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214415291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:24,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:24,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:40:24,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154747156] [2022-07-23 06:40:24,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:24,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:40:24,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:24,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:40:24,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:24,861 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-23 06:40:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:24,934 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-23 06:40:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:40:24,934 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-23 06:40:24,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:24,937 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:40:24,937 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:40:24,937 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-23 06:40:24,939 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:24,939 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-23 06:40:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:40:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-23 06:40:24,949 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-23 06:40:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-23 06:40:24,949 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 9 [2022-07-23 06:40:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:24,949 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-23 06:40:24,949 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-23 06:40:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-23 06:40:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:40:24,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:24,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:24,959 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-23 06:40:25,158 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-23 06:40:25,159 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-23 06:40:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-07-23 06:40:25,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:25,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275012900] [2022-07-23 06:40:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:25,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:25,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:25,161 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-23 06:40:25,162 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-23 06:40:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:25,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:40:25,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:25,217 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-23 06:40:25,236 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-23 06:40:25,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:25,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:25,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275012900] [2022-07-23 06:40:25,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275012900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:25,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:25,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:40:25,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140971865] [2022-07-23 06:40:25,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:25,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:40:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:25,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:40:25,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:40:25,238 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-23 06:40:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:25,276 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-07-23 06:40:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:40:25,279 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-23 06:40:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:25,280 INFO L225 Difference]: With dead ends: 120 [2022-07-23 06:40:25,280 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 06:40:25,280 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-23 06:40:25,280 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-23 06:40:25,281 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-23 06:40:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 06:40:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-23 06:40:25,283 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-23 06:40:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-07-23 06:40:25,284 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 9 [2022-07-23 06:40:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:25,284 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-07-23 06:40:25,284 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-23 06:40:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-07-23 06:40:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:40:25,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:25,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:25,293 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-23 06:40:25,491 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-23 06:40:25,492 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-23 06:40:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2022-07-23 06:40:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:25,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181748013] [2022-07-23 06:40:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:25,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:25,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:25,504 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-23 06:40:25,505 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-23 06:40:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:25,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:40:25,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:25,568 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-23 06:40:25,604 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:40:25,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 06:40:25,621 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-23 06:40:25,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:25,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:25,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181748013] [2022-07-23 06:40:25,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181748013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:25,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:25,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:40:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705049579] [2022-07-23 06:40:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:25,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:40:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:25,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:40:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:40:25,623 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-23 06:40:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:25,718 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-23 06:40:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:40:25,719 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-23 06:40:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:25,719 INFO L225 Difference]: With dead ends: 124 [2022-07-23 06:40:25,719 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:40:25,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:40:25,720 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-23 06:40:25,720 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-23 06:40:25,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:40:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-23 06:40:25,722 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-23 06:40:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2022-07-23 06:40:25,723 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 10 [2022-07-23 06:40:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:25,723 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2022-07-23 06:40:25,723 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-23 06:40:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2022-07-23 06:40:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:40:25,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:25,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:25,733 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-23 06:40:25,924 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-23 06:40:25,924 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-23 06:40:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2022-07-23 06:40:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:25,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566527277] [2022-07-23 06:40:25,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:25,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:25,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:25,926 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-23 06:40:25,926 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-23 06:40:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:25,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:40:25,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:26,001 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-23 06:40:26,005 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-23 06:40:26,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:26,068 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-23 06:40:26,086 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:40:26,087 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-23 06:40:26,107 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-23 06:40:26,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:26,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:26,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566527277] [2022-07-23 06:40:26,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566527277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:26,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:26,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:40:26,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424946006] [2022-07-23 06:40:26,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:26,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:40:26,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:26,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:40:26,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:40:26,108 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-23 06:40:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:26,217 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-23 06:40:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:40:26,218 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-23 06:40:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:26,219 INFO L225 Difference]: With dead ends: 124 [2022-07-23 06:40:26,219 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:40:26,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:40:26,219 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-23 06:40:26,220 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-23 06:40:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:40:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-23 06:40:26,222 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-23 06:40:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2022-07-23 06:40:26,222 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 10 [2022-07-23 06:40:26,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:26,222 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2022-07-23 06:40:26,222 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-23 06:40:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2022-07-23 06:40:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 06:40:26,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:26,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:26,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-23 06:40:26,440 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-23 06:40:26,441 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-23 06:40:26,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:26,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2022-07-23 06:40:26,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:26,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529020181] [2022-07-23 06:40:26,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:26,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:26,442 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-23 06:40:26,443 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-23 06:40:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:26,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:40:26,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:26,540 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-23 06:40:26,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:26,579 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-23 06:40:26,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:26,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529020181] [2022-07-23 06:40:26,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529020181] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:26,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:40:26,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-23 06:40:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402318457] [2022-07-23 06:40:26,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:26,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:40:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:40:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:40:26,581 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-23 06:40:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:26,606 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2022-07-23 06:40:26,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:40:26,607 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-23 06:40:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:26,607 INFO L225 Difference]: With dead ends: 131 [2022-07-23 06:40:26,608 INFO L226 Difference]: Without dead ends: 131 [2022-07-23 06:40:26,608 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-23 06:40:26,608 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-23 06:40:26,608 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-23 06:40:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-23 06:40:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2022-07-23 06:40:26,610 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-23 06:40:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2022-07-23 06:40:26,611 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 14 [2022-07-23 06:40:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:26,611 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2022-07-23 06:40:26,611 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-23 06:40:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-07-23 06:40:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:40:26,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:26,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:26,622 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-23 06:40:26,820 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-23 06:40:26,821 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-23 06:40:26,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2022-07-23 06:40:26,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:26,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314809661] [2022-07-23 06:40:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:26,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:26,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:26,822 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-23 06:40:26,823 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-23 06:40:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:26,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:40:26,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:26,893 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-23 06:40:26,917 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:40:26,917 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-23 06:40:26,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-23 06:40:26,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:26,951 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-23 06:40:26,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:26,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314809661] [2022-07-23 06:40:26,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314809661] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:26,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:40:26,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-23 06:40:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401224339] [2022-07-23 06:40:26,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:26,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:40:26,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:26,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:40:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:40:26,953 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-23 06:40:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:27,046 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2022-07-23 06:40:27,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:40:27,046 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-23 06:40:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:27,047 INFO L225 Difference]: With dead ends: 123 [2022-07-23 06:40:27,047 INFO L226 Difference]: Without dead ends: 123 [2022-07-23 06:40:27,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 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-23 06:40:27,047 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-23 06:40:27,048 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-23 06:40:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-23 06:40:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-23 06:40:27,049 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-23 06:40:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2022-07-23 06:40:27,049 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 15 [2022-07-23 06:40:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:27,050 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2022-07-23 06:40:27,050 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-23 06:40:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2022-07-23 06:40:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:40:27,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:27,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:27,072 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-23 06:40:27,251 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-23 06:40:27,251 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-23 06:40:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2022-07-23 06:40:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:27,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569660049] [2022-07-23 06:40:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:27,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:27,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:27,253 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-23 06:40:27,255 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-23 06:40:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:27,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:40:27,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:27,325 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-23 06:40:27,329 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-23 06:40:27,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:27,374 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-23 06:40:27,380 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:40:27,380 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-23 06:40:27,399 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-23 06:40:27,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:31,702 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-23 06:40:31,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:31,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569660049] [2022-07-23 06:40:31,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569660049] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:31,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:40:31,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-23 06:40:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000526120] [2022-07-23 06:40:31,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:31,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:40:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:40:31,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:40:31,704 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-23 06:40:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:31,841 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-07-23 06:40:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:40:31,841 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-23 06:40:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:31,842 INFO L225 Difference]: With dead ends: 121 [2022-07-23 06:40:31,842 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 06:40:31,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:40:31,842 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-23 06:40:31,842 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-23 06:40:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 06:40:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-23 06:40:31,844 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-23 06:40:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2022-07-23 06:40:31,844 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 15 [2022-07-23 06:40:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:31,844 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2022-07-23 06:40:31,844 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-23 06:40:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2022-07-23 06:40:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:40:31,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:31,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:31,863 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-23 06:40:32,051 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-23 06:40:32,051 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-23 06:40:32,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:32,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2022-07-23 06:40:32,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:32,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937254455] [2022-07-23 06:40:32,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:32,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:32,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:32,053 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-23 06:40:32,054 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-23 06:40:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:32,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:40:32,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:32,140 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-23 06:40:32,164 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-23 06:40:32,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:32,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:32,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937254455] [2022-07-23 06:40:32,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937254455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:32,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:32,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:40:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572426793] [2022-07-23 06:40:32,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:32,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:40:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:32,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:40:32,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:40:32,165 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-23 06:40:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:32,313 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2022-07-23 06:40:32,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:40:32,314 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-23 06:40:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:32,314 INFO L225 Difference]: With dead ends: 118 [2022-07-23 06:40:32,314 INFO L226 Difference]: Without dead ends: 118 [2022-07-23 06:40:32,314 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-23 06:40:32,315 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-23 06:40:32,315 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-23 06:40:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-23 06:40:32,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-23 06:40:32,316 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-23 06:40:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2022-07-23 06:40:32,317 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 22 [2022-07-23 06:40:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:32,317 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2022-07-23 06:40:32,317 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-23 06:40:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2022-07-23 06:40:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:40:32,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:32,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:40:32,326 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-23 06:40:32,518 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-23 06:40:32,518 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-23 06:40:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2022-07-23 06:40:32,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:32,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724854504] [2022-07-23 06:40:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:32,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:32,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:32,520 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-23 06:40:32,522 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-23 06:40:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:32,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:40:32,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:32,606 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-23 06:40:32,665 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-23 06:40:32,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:32,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:32,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724854504] [2022-07-23 06:40:32,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724854504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:32,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:32,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:40:32,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024467943] [2022-07-23 06:40:32,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:32,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:40:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:40:32,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:40:32,666 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-23 06:40:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:32,811 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-07-23 06:40:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:40:32,811 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-23 06:40:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:32,811 INFO L225 Difference]: With dead ends: 111 [2022-07-23 06:40:32,811 INFO L226 Difference]: Without dead ends: 111 [2022-07-23 06:40:32,812 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-23 06:40:32,812 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-23 06:40:32,812 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-23 06:40:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-23 06:40:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-23 06:40:32,814 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-23 06:40:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2022-07-23 06:40:32,814 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 22 [2022-07-23 06:40:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:32,814 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2022-07-23 06:40:32,814 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-23 06:40:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2022-07-23 06:40:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:40:32,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:32,815 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-23 06:40:32,825 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-23 06:40:33,015 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-23 06:40:33,015 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-23 06:40:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2022-07-23 06:40:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:33,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991829330] [2022-07-23 06:40:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:33,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:33,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:33,017 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-23 06:40:33,018 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-23 06:40:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:33,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:40:33,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:33,374 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-23 06:40:33,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:33,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:33,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991829330] [2022-07-23 06:40:33,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991829330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:33,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:33,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:40:33,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384869562] [2022-07-23 06:40:33,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:33,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:40:33,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:33,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:40:33,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:40:33,375 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-23 06:40:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:33,395 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2022-07-23 06:40:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:40:33,396 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-23 06:40:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:33,396 INFO L225 Difference]: With dead ends: 110 [2022-07-23 06:40:33,396 INFO L226 Difference]: Without dead ends: 110 [2022-07-23 06:40:33,396 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-23 06:40:33,397 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-23 06:40:33,397 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-23 06:40:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-23 06:40:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-23 06:40:33,398 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-23 06:40:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2022-07-23 06:40:33,399 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 28 [2022-07-23 06:40:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:33,399 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2022-07-23 06:40:33,399 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-23 06:40:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2022-07-23 06:40:33,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:40:33,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:33,399 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-23 06:40:33,408 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-23 06:40:33,609 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-23 06:40:33,609 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-23 06:40:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2022-07-23 06:40:33,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:33,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277145739] [2022-07-23 06:40:33,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:33,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:33,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:33,611 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-23 06:40:33,611 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-23 06:40:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:33,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 06:40:33,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:33,748 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-23 06:40:33,786 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-23 06:40:33,805 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-23 06:40:33,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:33,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:33,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277145739] [2022-07-23 06:40:33,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277145739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:33,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:33,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:40:33,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018007633] [2022-07-23 06:40:33,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:33,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:40:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:33,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:40:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:40:33,807 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-23 06:40:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:34,044 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-07-23 06:40:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:40:34,045 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-23 06:40:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:34,045 INFO L225 Difference]: With dead ends: 105 [2022-07-23 06:40:34,045 INFO L226 Difference]: Without dead ends: 105 [2022-07-23 06:40:34,046 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-23 06:40:34,046 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-23 06:40:34,046 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-23 06:40:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-23 06:40:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-23 06:40:34,047 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-23 06:40:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-07-23 06:40:34,048 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 28 [2022-07-23 06:40:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:34,048 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-07-23 06:40:34,048 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-23 06:40:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-07-23 06:40:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:40:34,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:34,048 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-23 06:40:34,059 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-23 06:40:34,249 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-23 06:40:34,249 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-23 06:40:34,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2022-07-23 06:40:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:34,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699010742] [2022-07-23 06:40:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:34,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:34,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:34,251 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-23 06:40:34,256 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-23 06:40:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:34,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-23 06:40:34,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:34,360 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-23 06:40:34,418 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:40:34,419 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-23 06:40:34,457 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-23 06:40:34,489 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-23 06:40:34,532 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-23 06:40:34,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:34,556 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-23 06:40:34,606 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-23 06:40:34,633 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-23 06:40:34,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:34,706 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-23 06:40:34,712 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-23 06:40:34,717 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-23 06:40:34,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:34,723 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-23 06:40:34,726 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-23 06:40:34,728 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-23 06:40:34,731 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-23 06:40:34,939 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:40:34,939 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-23 06:40:34,947 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-23 06:40:34,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:34,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699010742] [2022-07-23 06:40:34,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699010742] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:34,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:40:34,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-07-23 06:40:34,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939118766] [2022-07-23 06:40:34,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:34,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 06:40:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:34,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 06:40:34,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=411, Unknown=3, NotChecked=126, Total=600 [2022-07-23 06:40:34,948 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-23 06:40:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:35,642 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-07-23 06:40:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:40:35,642 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-23 06:40:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:35,642 INFO L225 Difference]: With dead ends: 104 [2022-07-23 06:40:35,642 INFO L226 Difference]: Without dead ends: 104 [2022-07-23 06:40:35,643 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-23 06:40:35,643 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:35,643 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.3s Time] [2022-07-23 06:40:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-23 06:40:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2022-07-23 06:40:35,645 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-23 06:40:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-07-23 06:40:35,645 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 28 [2022-07-23 06:40:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:35,645 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-07-23 06:40:35,645 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-23 06:40:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-07-23 06:40:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:40:35,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:35,646 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-23 06:40:35,653 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-23 06:40:35,853 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-23 06:40:35,853 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-23 06:40:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2022-07-23 06:40:35,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:35,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588214152] [2022-07-23 06:40:35,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:35,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:35,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:35,860 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-23 06:40:35,861 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-23 06:40:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:35,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:40:35,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:36,075 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-23 06:40:36,143 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-23 06:40:36,195 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-23 06:40:36,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:36,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:36,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588214152] [2022-07-23 06:40:36,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588214152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:36,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:36,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:40:36,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537286311] [2022-07-23 06:40:36,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:36,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:40:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:36,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:40:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:40:36,197 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-23 06:40:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:36,721 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-07-23 06:40:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:40:36,721 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-23 06:40:36,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:36,722 INFO L225 Difference]: With dead ends: 96 [2022-07-23 06:40:36,722 INFO L226 Difference]: Without dead ends: 96 [2022-07-23 06:40:36,722 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-23 06:40:36,722 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 653 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-23 06:40:36,723 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-23 06:40:36,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-23 06:40:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-23 06:40:36,724 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-23 06:40:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-07-23 06:40:36,724 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 29 [2022-07-23 06:40:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:36,725 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-07-23 06:40:36,725 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-23 06:40:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-07-23 06:40:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:40:36,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:36,725 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-23 06:40:36,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-23 06:40:36,936 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-23 06:40:36,936 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-23 06:40:36,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:36,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2022-07-23 06:40:36,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:36,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939843965] [2022-07-23 06:40:36,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:36,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:36,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:36,939 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-23 06:40:36,939 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-23 06:40:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:37,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 06:40:37,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:37,070 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-23 06:40:37,137 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:40:37,137 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-23 06:40:37,172 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-23 06:40:37,211 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:37,211 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-23 06:40:37,279 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-23 06:40:37,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:37,306 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-23 06:40:37,374 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-23 06:40:37,417 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-23 06:40:37,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:37,507 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-23 06:40:37,515 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_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:40:37,522 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-23 06:40:37,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:37,528 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-23 06:40:37,530 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-23 06:40:37,533 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-23 06:40:37,536 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-23 06:40:37,799 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:40:37,799 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-23 06:40:37,805 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-23 06:40:37,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:37,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939843965] [2022-07-23 06:40:37,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939843965] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:37,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:40:37,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-07-23 06:40:37,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175252157] [2022-07-23 06:40:37,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:37,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 06:40:37,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:37,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 06:40:37,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=409, Unknown=3, NotChecked=126, Total=600 [2022-07-23 06:40:37,807 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-23 06:40:38,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:38,896 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2022-07-23 06:40:38,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:40:38,896 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-23 06:40:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:38,897 INFO L225 Difference]: With dead ends: 179 [2022-07-23 06:40:38,897 INFO L226 Difference]: Without dead ends: 179 [2022-07-23 06:40:38,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=752, Unknown=3, NotChecked=174, Total=1056 [2022-07-23 06:40:38,898 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 488 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:38,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 514 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 679 Invalid, 0 Unknown, 629 Unchecked, 0.7s Time] [2022-07-23 06:40:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-23 06:40:38,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 133. [2022-07-23 06:40:38,902 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-23 06:40:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2022-07-23 06:40:38,902 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 29 [2022-07-23 06:40:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:38,903 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2022-07-23 06:40:38,903 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-23 06:40:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2022-07-23 06:40:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:40:38,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:38,903 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-23 06:40:38,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 06:40:39,111 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-23 06:40:39,111 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-23 06:40:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2022-07-23 06:40:39,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:39,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093585590] [2022-07-23 06:40:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:39,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:39,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:39,113 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-23 06:40:39,114 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-23 06:40:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:39,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 06:40:39,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:39,219 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-23 06:40:39,259 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-23 06:40:39,282 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-23 06:40:39,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:39,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:39,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093585590] [2022-07-23 06:40:39,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093585590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:39,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:39,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:40:39,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607349538] [2022-07-23 06:40:39,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:39,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:40:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:40:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:40:39,286 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-23 06:40:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:39,627 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2022-07-23 06:40:39,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:40:39,628 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-23 06:40:39,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:39,629 INFO L225 Difference]: With dead ends: 132 [2022-07-23 06:40:39,629 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 06:40:39,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:40:39,629 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 218 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:39,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 311 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:40:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 06:40:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-23 06:40:39,631 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-23 06:40:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2022-07-23 06:40:39,631 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 30 [2022-07-23 06:40:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:39,632 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2022-07-23 06:40:39,632 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-23 06:40:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2022-07-23 06:40:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:40:39,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:39,632 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-23 06:40:39,641 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-23 06:40:39,841 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-23 06:40:39,841 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-23 06:40:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2022-07-23 06:40:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:39,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218866284] [2022-07-23 06:40:39,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:39,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:39,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:39,843 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-23 06:40:39,844 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-23 06:40:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:39,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 06:40:39,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:39,957 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-23 06:40:40,002 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:40:40,002 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-23 06:40:40,028 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-23 06:40:40,070 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:40,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:40:40,121 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-23 06:40:40,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:40,143 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-23 06:40:40,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 06:40:40,229 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-23 06:40:40,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:40,379 INFO L356 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2022-07-23 06:40:40,379 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 22 treesize of output 21 [2022-07-23 06:40:40,384 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-23 06:40:40,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:40,389 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-23 06:40:40,392 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-23 06:40:40,396 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-23 06:40:40,399 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-23 06:40:40,501 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:40:40,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 29 treesize of output 28 [2022-07-23 06:40:40,507 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-23 06:40:40,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:40,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218866284] [2022-07-23 06:40:40,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218866284] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:40,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:40:40,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2022-07-23 06:40:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846249983] [2022-07-23 06:40:40,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:40,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 06:40:40,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:40,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 06:40:40,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=405, Unknown=5, NotChecked=40, Total=506 [2022-07-23 06:40:40,508 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-23 06:40:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:41,459 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2022-07-23 06:40:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:40:41,460 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-23 06:40:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:41,460 INFO L225 Difference]: With dead ends: 131 [2022-07-23 06:40:41,460 INFO L226 Difference]: Without dead ends: 131 [2022-07-23 06:40:41,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=916, Unknown=5, NotChecked=64, Total=1190 [2022-07-23 06:40:41,461 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 122 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:41,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 812 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 655 Invalid, 0 Unknown, 157 Unchecked, 0.5s Time] [2022-07-23 06:40:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-23 06:40:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-23 06:40:41,463 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-23 06:40:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2022-07-23 06:40:41,463 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 30 [2022-07-23 06:40:41,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:41,463 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2022-07-23 06:40:41,463 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-23 06:40:41,463 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2022-07-23 06:40:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:40:41,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:41,464 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-23 06:40:41,473 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-23 06:40:41,671 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-23 06:40:41,672 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-23 06:40:41,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2022-07-23 06:40:41,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:41,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814847549] [2022-07-23 06:40:41,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:41,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:41,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:41,674 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-23 06:40:41,675 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-23 06:40:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:41,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:40:41,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:41,810 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:40:41,810 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-23 06:40:41,856 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-23 06:40:41,901 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-23 06:40:41,944 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-23 06:40:41,959 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-23 06:40:41,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:42,153 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:40:42,153 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-23 06:40:42,158 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-23 06:40:42,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:42,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814847549] [2022-07-23 06:40:42,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814847549] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:42,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:40:42,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2022-07-23 06:40:42,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520316497] [2022-07-23 06:40:42,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:42,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-23 06:40:42,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:42,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 06:40:42,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-07-23 06:40:42,160 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-23 06:40:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:42,753 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-07-23 06:40:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:40:42,753 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-23 06:40:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:42,753 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:40:42,754 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:40:42,754 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-23 06:40:42,754 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 323 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:42,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 282 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:40:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:40:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-23 06:40:42,756 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-23 06:40:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-07-23 06:40:42,756 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 33 [2022-07-23 06:40:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:42,756 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-07-23 06:40:42,756 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-23 06:40:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-07-23 06:40:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:40:42,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:42,757 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-23 06:40:42,772 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-23 06:40:42,971 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-23 06:40:42,972 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-23 06:40:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2022-07-23 06:40:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:42,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987814142] [2022-07-23 06:40:42,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:42,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:42,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:42,974 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-23 06:40:42,978 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-23 06:40:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:43,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-23 06:40:43,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:43,102 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-23 06:40:43,142 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 06:40:43,143 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-23 06:40:43,178 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-23 06:40:43,203 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:43,203 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-23 06:40:43,259 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-23 06:40:43,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:43,282 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-23 06:40:43,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 06:40:43,384 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-23 06:40:43,402 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-23 06:40:43,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:43,521 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_640 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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))) (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|))))) is different from false [2022-07-23 06:40:43,537 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_640 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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-23 06:40:43,550 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:43,551 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 37 treesize of output 41 [2022-07-23 06:40:43,574 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-23 06:40:43,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:43,581 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-23 06:40:43,582 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-23 06:40:43,585 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-23 06:40:43,588 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-23 06:40:43,609 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:40:43,609 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-23 06:40:43,688 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:40:43,689 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 29 treesize of output 28 [2022-07-23 06:40:43,694 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-23 06:40:43,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:43,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987814142] [2022-07-23 06:40:43,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987814142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:43,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:40:43,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-07-23 06:40:43,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456039204] [2022-07-23 06:40:43,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:43,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 06:40:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 06:40:43,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=372, Unknown=3, NotChecked=120, Total=552 [2022-07-23 06:40:43,695 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-23 06:40:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:44,477 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2022-07-23 06:40:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:40:44,477 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-23 06:40:44,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:44,478 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:40:44,478 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:40:44,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=795, Unknown=3, NotChecked=180, Total=1122 [2022-07-23 06:40:44,479 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 115 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:44,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 796 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 675 Invalid, 0 Unknown, 176 Unchecked, 0.4s Time] [2022-07-23 06:40:44,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:40:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-23 06:40:44,481 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-23 06:40:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2022-07-23 06:40:44,481 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 33 [2022-07-23 06:40:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:44,481 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2022-07-23 06:40:44,482 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-23 06:40:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2022-07-23 06:40:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:40:44,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:44,482 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-23 06:40:44,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-23 06:40:44,690 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-23 06:40:44,690 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-23 06:40:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash 226977724, now seen corresponding path program 1 times [2022-07-23 06:40:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:44,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582919628] [2022-07-23 06:40:44,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:44,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:44,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:44,692 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-23 06:40:44,692 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-23 06:40:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:44,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:40:44,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:45,014 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-23 06:40:45,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:45,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:45,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582919628] [2022-07-23 06:40:45,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582919628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:45,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:45,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:40:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494705110] [2022-07-23 06:40:45,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:45,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:40:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:45,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:40:45,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:40:45,016 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-23 06:40:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:45,020 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2022-07-23 06:40:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:40:45,021 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-23 06:40:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:45,022 INFO L225 Difference]: With dead ends: 128 [2022-07-23 06:40:45,022 INFO L226 Difference]: Without dead ends: 128 [2022-07-23 06:40:45,022 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-23 06:40:45,023 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:45,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 205 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 38 Unchecked, 0.0s Time] [2022-07-23 06:40:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-23 06:40:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-23 06:40:45,025 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-23 06:40:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-07-23 06:40:45,026 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 33 [2022-07-23 06:40:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:45,026 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-07-23 06:40:45,026 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-23 06:40:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-07-23 06:40:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:40:45,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:45,027 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-23 06:40:45,034 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-23 06:40:45,234 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-23 06:40:45,234 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-23 06:40:45,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash 226963822, now seen corresponding path program 1 times [2022-07-23 06:40:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:45,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682727019] [2022-07-23 06:40:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:45,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:45,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:45,236 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-23 06:40:45,237 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-23 06:40:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:45,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:40:45,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:45,543 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-23 06:40:45,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:45,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:45,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682727019] [2022-07-23 06:40:45,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682727019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:45,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:45,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:40:45,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415828542] [2022-07-23 06:40:45,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:45,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:40:45,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:45,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:40:45,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:40:45,545 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-23 06:40:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:45,558 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-07-23 06:40:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:40:45,559 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-23 06:40:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:45,559 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:40:45,559 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:40:45,560 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-23 06:40:45,560 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 69 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:45,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 210 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 46 Unchecked, 0.0s Time] [2022-07-23 06:40:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:40:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-07-23 06:40:45,562 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-23 06:40:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2022-07-23 06:40:45,562 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 33 [2022-07-23 06:40:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:45,562 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2022-07-23 06:40:45,563 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-23 06:40:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2022-07-23 06:40:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:40:45,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:45,563 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-23 06:40:45,572 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-23 06:40:45,770 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-23 06:40:45,770 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-23 06:40:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash -262609016, now seen corresponding path program 1 times [2022-07-23 06:40:45,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:45,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944478176] [2022-07-23 06:40:45,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:45,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:45,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:45,772 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-23 06:40:45,773 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-23 06:40:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:45,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:40:45,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:46,090 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-23 06:40:46,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:40:46,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:46,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944478176] [2022-07-23 06:40:46,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944478176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:40:46,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:40:46,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:40:46,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341745174] [2022-07-23 06:40:46,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:40:46,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:40:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:46,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:40:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:40:46,093 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-23 06:40:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:46,096 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-23 06:40:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:40:46,096 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-23 06:40:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:46,097 INFO L225 Difference]: With dead ends: 126 [2022-07-23 06:40:46,097 INFO L226 Difference]: Without dead ends: 126 [2022-07-23 06:40:46,097 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-23 06:40:46,098 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 25 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:46,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 204 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 33 Unchecked, 0.0s Time] [2022-07-23 06:40:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-23 06:40:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-23 06:40:46,103 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-23 06:40:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2022-07-23 06:40:46,104 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 33 [2022-07-23 06:40:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:46,104 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2022-07-23 06:40:46,104 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-23 06:40:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-07-23 06:40:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:40:46,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:46,105 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-23 06:40:46,128 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-23 06:40:46,311 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-23 06:40:46,311 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-23 06:40:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2022-07-23 06:40:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:46,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126060490] [2022-07-23 06:40:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:46,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:46,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:46,313 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-23 06:40:46,314 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-23 06:40:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:46,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:40:46,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:46,440 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:40:46,440 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-23 06:40:46,506 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-23 06:40:46,563 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-23 06:40:46,629 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-23 06:40:46,644 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-23 06:40:46,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:46,864 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:40:46,865 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-23 06:40:46,870 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-23 06:40:46,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:46,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126060490] [2022-07-23 06:40:46,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126060490] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:46,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:40:46,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-07-23 06:40:46,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708502728] [2022-07-23 06:40:46,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:46,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 06:40:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:46,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 06:40:46,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:40:46,872 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-23 06:40:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:47,282 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-07-23 06:40:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:40:47,282 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-23 06:40:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:47,283 INFO L225 Difference]: With dead ends: 125 [2022-07-23 06:40:47,283 INFO L226 Difference]: Without dead ends: 125 [2022-07-23 06:40:47,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2022-07-23 06:40:47,283 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 62 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:47,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 557 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 271 Unchecked, 0.2s Time] [2022-07-23 06:40:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-23 06:40:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-23 06:40:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 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-23 06:40:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-07-23 06:40:47,285 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 34 [2022-07-23 06:40:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:47,286 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-07-23 06:40:47,286 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-23 06:40:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-07-23 06:40:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:40:47,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:47,286 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-23 06:40:47,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-23 06:40:47,493 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-23 06:40:47,494 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-23 06:40:47,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1554055919, now seen corresponding path program 1 times [2022-07-23 06:40:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:47,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320388816] [2022-07-23 06:40:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:47,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:47,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:47,495 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-23 06:40:47,496 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-23 06:40:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:47,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:40:47,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:47,630 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:40:47,631 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-23 06:40:47,702 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-23 06:40:47,769 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-23 06:40:47,831 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-23 06:40:47,846 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-23 06:40:47,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:48,060 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:40:48,060 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-23 06:40:48,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-23 06:40:48,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:40:48,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320388816] [2022-07-23 06:40:48,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320388816] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:40:48,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:40:48,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-07-23 06:40:48,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913704995] [2022-07-23 06:40:48,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:40:48,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 06:40:48,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:40:48,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 06:40:48,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:40:48,067 INFO L87 Difference]: Start difference. First operand 125 states and 136 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-23 06:40:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:40:48,537 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-07-23 06:40:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 06:40:48,538 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-23 06:40:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:40:48,538 INFO L225 Difference]: With dead ends: 124 [2022-07-23 06:40:48,538 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 06:40:48,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2022-07-23 06:40:48,539 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:40:48,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 461 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 287 Invalid, 0 Unknown, 166 Unchecked, 0.2s Time] [2022-07-23 06:40:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 06:40:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-23 06:40:48,540 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-23 06:40:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2022-07-23 06:40:48,541 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 34 [2022-07-23 06:40:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:40:48,541 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2022-07-23 06:40:48,541 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-23 06:40:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-07-23 06:40:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:40:48,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:40:48,542 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-23 06:40:48,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-23 06:40:48,749 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-23 06:40:48,749 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-23 06:40:48,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:40:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2022-07-23 06:40:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:40:48,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741363696] [2022-07-23 06:40:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:40:48,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:40:48,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:40:48,751 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-23 06:40:48,752 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-23 06:40:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:40:48,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-23 06:40:48,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:40:48,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-23 06:40:48,907 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:40:48,908 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-23 06:40:48,989 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-23 06:40:48,992 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-23 06:40:49,054 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-23 06:40:49,107 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:40:49,107 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 40 treesize of output 39 [2022-07-23 06:40:49,180 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-23 06:40:49,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:40:49,196 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-23 06:40:49,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:49,388 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-23 06:40:49,451 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 23 treesize of output 23 [2022-07-23 06:40:49,471 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-23 06:40:49,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:40:49,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:40:49,859 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 26 treesize of output 27 [2022-07-23 06:40:49,861 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 80 treesize of output 72 [2022-07-23 06:40:49,865 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 34 treesize of output 32 [2022-07-23 06:40:49,867 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 66 treesize of output 62 [2022-07-23 06:41:13,437 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-23 06:41:13,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:41:13,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741363696] [2022-07-23 06:41:13,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741363696] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:41:13,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:41:13,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2022-07-23 06:41:13,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412557815] [2022-07-23 06:41:13,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:41:13,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 06:41:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:41:13,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 06:41:13,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1106, Unknown=11, NotChecked=0, Total=1260 [2022-07-23 06:41:13,439 INFO L87 Difference]: Start difference. First operand 124 states and 134 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-23 06:41:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:41:14,385 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-07-23 06:41:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:41:14,385 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 34 [2022-07-23 06:41:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:41:14,386 INFO L225 Difference]: With dead ends: 123 [2022-07-23 06:41:14,386 INFO L226 Difference]: Without dead ends: 123 [2022-07-23 06:41:14,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=250, Invalid=1809, Unknown=11, NotChecked=0, Total=2070 [2022-07-23 06:41:14,387 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 86 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:41:14,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 570 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 197 Invalid, 0 Unknown, 486 Unchecked, 0.3s Time] [2022-07-23 06:41:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-23 06:41:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-23 06:41:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 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-23 06:41:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-07-23 06:41:14,389 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 34 [2022-07-23 06:41:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:41:14,389 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-07-23 06:41:14,389 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-23 06:41:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-07-23 06:41:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:41:14,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:41:14,389 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-23 06:41:14,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-23 06:41:14,596 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-23 06:41:14,597 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-23 06:41:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:41:14,597 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2022-07-23 06:41:14,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:41:14,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944255276] [2022-07-23 06:41:14,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:41:14,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:41:14,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:41:14,598 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-23 06:41:14,600 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-23 06:41:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:41:14,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-23 06:41:14,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:41:14,730 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-23 06:41:14,788 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-23 06:41:14,789 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 22 treesize of output 39 [2022-07-23 06:41:14,841 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-23 06:41:14,880 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:41:14,880 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 30 treesize of output 31 [2022-07-23 06:41:14,949 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 26 treesize of output 26 [2022-07-23 06:41:14,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:14,999 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-23 06:41:15,064 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-23 06:41:15,123 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 23 treesize of output 23 [2022-07-23 06:41:15,141 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-23 06:41:15,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:41:15,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_950 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_953 (_ BitVec 1))) (= (_ bv0 1) (bvadd (bvneg (select (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_953) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (_ bv1 1)))) is different from false [2022-07-23 06:41:15,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_950 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_953 (_ BitVec 1))) (= (bvadd (bvneg (select (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_953) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-07-23 06:41:15,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_950 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_949 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_953 (_ BitVec 1))) (= (bvadd (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_949) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_953) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-07-23 06:41:15,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:15,327 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 29 treesize of output 30 [2022-07-23 06:41:15,329 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 186 treesize of output 174 [2022-07-23 06:41:15,333 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 85 treesize of output 81 [2022-07-23 06:41:15,335 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 166 treesize of output 158 [2022-07-23 06:41:15,732 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:41:15,733 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 29 treesize of output 28 [2022-07-23 06:41:15,738 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-23 06:41:15,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:41:15,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944255276] [2022-07-23 06:41:15,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944255276] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:41:15,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:41:15,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-07-23 06:41:15,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087331067] [2022-07-23 06:41:15,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:41:15,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 06:41:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:41:15,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 06:41:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=437, Unknown=3, NotChecked=132, Total=650 [2022-07-23 06:41:15,739 INFO L87 Difference]: Start difference. First operand 123 states and 133 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-23 06:41:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:41:16,365 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2022-07-23 06:41:16,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:41:16,365 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-23 06:41:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:41:16,366 INFO L225 Difference]: With dead ends: 122 [2022-07-23 06:41:16,366 INFO L226 Difference]: Without dead ends: 122 [2022-07-23 06:41:16,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=734, Unknown=3, NotChecked=174, Total=1056 [2022-07-23 06:41:16,367 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 84 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 452 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:41:16,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 778 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 464 Invalid, 0 Unknown, 452 Unchecked, 0.4s Time] [2022-07-23 06:41:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-23 06:41:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-23 06:41:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 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-23 06:41:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2022-07-23 06:41:16,371 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 34 [2022-07-23 06:41:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:41:16,371 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2022-07-23 06:41:16,372 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-23 06:41:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2022-07-23 06:41:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 06:41:16,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:41:16,372 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-23 06:41:16,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-23 06:41:16,579 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-23 06:41:16,579 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-23 06:41:16,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:41:16,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1035188976, now seen corresponding path program 2 times [2022-07-23 06:41:16,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:41:16,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976898575] [2022-07-23 06:41:16,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:41:16,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:41:16,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:41:16,581 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-23 06:41:16,582 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-23 06:41:16,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:41:16,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:41:16,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:41:16,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:41:16,726 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-23 06:41:16,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:41:16,775 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-23 06:41:16,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:41:16,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976898575] [2022-07-23 06:41:16,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976898575] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:41:16,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:41:16,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 06:41:16,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144546093] [2022-07-23 06:41:16,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:41:16,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:41:16,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:41:16,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:41:16,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:41:16,776 INFO L87 Difference]: Start difference. First operand 122 states and 132 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-23 06:41:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:41:16,789 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-07-23 06:41:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:41:16,789 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-23 06:41:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:41:16,790 INFO L225 Difference]: With dead ends: 81 [2022-07-23 06:41:16,790 INFO L226 Difference]: Without dead ends: 81 [2022-07-23 06:41:16,790 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-23 06:41:16,790 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 207 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:41:16,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 240 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:41:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-23 06:41:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-23 06:41:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 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-23 06:41:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-07-23 06:41:16,792 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 34 [2022-07-23 06:41:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:41:16,792 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-07-23 06:41:16,792 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-23 06:41:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-07-23 06:41:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:41:16,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:41:16,793 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-23 06:41:16,801 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-23 06:41:17,001 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-23 06:41:17,002 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-23 06:41:17,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:41:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2022-07-23 06:41:17,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:41:17,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699371865] [2022-07-23 06:41:17,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:41:17,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:41:17,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:41:17,003 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-23 06:41:17,004 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-23 06:41:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:41:17,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-23 06:41:17,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:41:17,133 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-23 06:41:17,159 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:41:17,160 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-23 06:41:17,232 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:41:17,232 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-23 06:41:17,259 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-23 06:41:17,294 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:41:17,294 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-23 06:41:17,351 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-23 06:41:17,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:17,370 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 39 treesize of output 30 [2022-07-23 06:41:17,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:17,551 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-23 06:41:17,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-23 06:41:17,680 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-23 06:41:17,701 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-23 06:41:17,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:41:18,139 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1053 (_ BitVec 1)) (v_ArrVal_1050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1053) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (_ bv1 1))) (forall ((v_ArrVal_1050 (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_1050) |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-23 06:41:18,151 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1053 (_ BitVec 1)) (v_ArrVal_1050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1053) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1050 (Array (_ BitVec 32) (_ BitVec 32)))) (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_1050) |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-23 06:41:18,166 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:18,167 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 70 treesize of output 74 [2022-07-23 06:41:18,198 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1048) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_1050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1048 (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_1048) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1050) |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|))) (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_3 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_3) |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-23 06:41:18,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:18,211 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-23 06:41:18,213 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-23 06:41:18,217 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-23 06:41:18,224 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-23 06:41:18,229 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-23 06:41:18,234 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:41:18,234 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2022-07-23 06:41:18,243 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:41:18,244 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-23 06:41:29,331 WARN L233 SmtUtils]: Spent 8.67s on a formula simplification. DAG size of input: 32 DAG size of output: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:41:29,345 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-23 06:41:29,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:41:29,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699371865] [2022-07-23 06:41:29,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699371865] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:41:29,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:41:29,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2022-07-23 06:41:29,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326929101] [2022-07-23 06:41:29,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:41:29,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 06:41:29,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:41:29,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 06:41:29,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=954, Unknown=4, NotChecked=192, Total=1260 [2022-07-23 06:41:29,347 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 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-23 06:41:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:41:30,914 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-07-23 06:41:30,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 06:41:30,914 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 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-23 06:41:30,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:41:30,915 INFO L225 Difference]: With dead ends: 83 [2022-07-23 06:41:30,915 INFO L226 Difference]: Without dead ends: 83 [2022-07-23 06:41:30,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=259, Invalid=1819, Unknown=4, NotChecked=270, Total=2352 [2022-07-23 06:41:30,916 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 177 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 667 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:41:30,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 600 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 520 Invalid, 0 Unknown, 667 Unchecked, 0.5s Time] [2022-07-23 06:41:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-23 06:41:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-07-23 06:41:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.135135135135135) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 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-23 06:41:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-07-23 06:41:30,917 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 36 [2022-07-23 06:41:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:41:30,918 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-07-23 06:41:30,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 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-23 06:41:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-07-23 06:41:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:41:30,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:41:30,918 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-23 06:41:30,928 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-23 06:41:31,129 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-23 06:41:31,129 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-23 06:41:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:41:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1608865938, now seen corresponding path program 1 times [2022-07-23 06:41:31,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:41:31,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114048888] [2022-07-23 06:41:31,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:41:31,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:41:31,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:41:31,131 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:41:31,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-23 06:41:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:41:31,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-23 06:41:31,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:41:31,261 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-23 06:41:31,293 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:41:31,293 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-23 06:41:31,376 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-23 06:41:31,376 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-23 06:41:31,439 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-23 06:41:31,488 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:41:31,488 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 39 treesize of output 38 [2022-07-23 06:41:31,592 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 35 treesize of output 33 [2022-07-23 06:41:31,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:41:31,613 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 42 treesize of output 33 [2022-07-23 06:41:31,868 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:31,868 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 66 treesize of output 34 [2022-07-23 06:41:32,010 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 22 treesize of output 27 [2022-07-23 06:41:32,064 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 22 treesize of output 22 [2022-07-23 06:41:32,085 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-23 06:41:32,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:41:32,574 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:41:32,575 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 29 treesize of output 30 [2022-07-23 06:41:32,577 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 92 treesize of output 84 [2022-07-23 06:41:32,581 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 80 treesize of output 76 [2022-07-23 06:41:32,587 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 38 treesize of output 36 [2022-07-23 06:42:03,742 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-23 06:42:03,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:42:03,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114048888] [2022-07-23 06:42:03,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114048888] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:42:03,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:42:03,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2022-07-23 06:42:03,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752452068] [2022-07-23 06:42:03,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:42:03,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-23 06:42:03,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:42:03,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-23 06:42:03,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1240, Unknown=12, NotChecked=0, Total=1406 [2022-07-23 06:42:03,744 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 38 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-23 06:42:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:42:04,192 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-07-23 06:42:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:42:04,193 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 38 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-23 06:42:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:42:04,193 INFO L225 Difference]: With dead ends: 79 [2022-07-23 06:42:04,193 INFO L226 Difference]: Without dead ends: 79 [2022-07-23 06:42:04,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=232, Invalid=1648, Unknown=12, NotChecked=0, Total=1892 [2022-07-23 06:42:04,194 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:42:04,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 622 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 305 Unchecked, 0.1s Time] [2022-07-23 06:42:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-23 06:42:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-23 06:42:04,195 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-23 06:42:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-07-23 06:42:04,195 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 36 [2022-07-23 06:42:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:42:04,196 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-07-23 06:42:04,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 38 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-23 06:42:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-07-23 06:42:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:42:04,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:42:04,196 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-23 06:42:04,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-23 06:42:04,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:42:04,404 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2022-07-23 06:42:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:42:04,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1615055412, now seen corresponding path program 1 times [2022-07-23 06:42:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:42:04,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415456827] [2022-07-23 06:42:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:42:04,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:42:04,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:42:04,405 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:42:04,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-23 06:42:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 06:42:04,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 06:42:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 06:42:04,663 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-23 06:42:04,663 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 06:42:04,664 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2022-07-23 06:42:04,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2022-07-23 06:42:04,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2022-07-23 06:42:04,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2022-07-23 06:42:04,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2022-07-23 06:42:04,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2022-07-23 06:42:04,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2022-07-23 06:42:04,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2022-07-23 06:42:04,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2022-07-23 06:42:04,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2022-07-23 06:42:04,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2022-07-23 06:42:04,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2022-07-23 06:42:04,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2022-07-23 06:42:04,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2022-07-23 06:42:04,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2022-07-23 06:42:04,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2022-07-23 06:42:04,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2022-07-23 06:42:04,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (41 of 59 remaining) [2022-07-23 06:42:04,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (40 of 59 remaining) [2022-07-23 06:42:04,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (39 of 59 remaining) [2022-07-23 06:42:04,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (38 of 59 remaining) [2022-07-23 06:42:04,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (37 of 59 remaining) [2022-07-23 06:42:04,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (36 of 59 remaining) [2022-07-23 06:42:04,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (35 of 59 remaining) [2022-07-23 06:42:04,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (34 of 59 remaining) [2022-07-23 06:42:04,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (33 of 59 remaining) [2022-07-23 06:42:04,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE (32 of 59 remaining) [2022-07-23 06:42:04,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE (31 of 59 remaining) [2022-07-23 06:42:04,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE (30 of 59 remaining) [2022-07-23 06:42:04,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE (29 of 59 remaining) [2022-07-23 06:42:04,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE (28 of 59 remaining) [2022-07-23 06:42:04,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (27 of 59 remaining) [2022-07-23 06:42:04,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (26 of 59 remaining) [2022-07-23 06:42:04,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (25 of 59 remaining) [2022-07-23 06:42:04,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (24 of 59 remaining) [2022-07-23 06:42:04,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (23 of 59 remaining) [2022-07-23 06:42:04,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (22 of 59 remaining) [2022-07-23 06:42:04,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (21 of 59 remaining) [2022-07-23 06:42:04,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (20 of 59 remaining) [2022-07-23 06:42:04,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (19 of 59 remaining) [2022-07-23 06:42:04,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (18 of 59 remaining) [2022-07-23 06:42:04,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (17 of 59 remaining) [2022-07-23 06:42:04,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (16 of 59 remaining) [2022-07-23 06:42:04,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (15 of 59 remaining) [2022-07-23 06:42:04,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (14 of 59 remaining) [2022-07-23 06:42:04,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (13 of 59 remaining) [2022-07-23 06:42:04,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (12 of 59 remaining) [2022-07-23 06:42:04,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (11 of 59 remaining) [2022-07-23 06:42:04,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (10 of 59 remaining) [2022-07-23 06:42:04,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (9 of 59 remaining) [2022-07-23 06:42:04,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (8 of 59 remaining) [2022-07-23 06:42:04,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (7 of 59 remaining) [2022-07-23 06:42:04,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (6 of 59 remaining) [2022-07-23 06:42:04,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (5 of 59 remaining) [2022-07-23 06:42:04,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (4 of 59 remaining) [2022-07-23 06:42:04,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (3 of 59 remaining) [2022-07-23 06:42:04,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (2 of 59 remaining) [2022-07-23 06:42:04,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (1 of 59 remaining) [2022-07-23 06:42:04,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (0 of 59 remaining) [2022-07-23 06:42:04,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-23 06:42:04,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:42:04,886 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, 1, 1] [2022-07-23 06:42:04,888 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 06:42:04,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 06:42:04 BoogieIcfgContainer [2022-07-23 06:42:04,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 06:42:04,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 06:42:04,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 06:42:04,930 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 06:42:04,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:40:23" (3/4) ... [2022-07-23 06:42:04,932 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 06:42:04,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 06:42:04,933 INFO L158 Benchmark]: Toolchain (without parser) took 102400.91ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 43.5MB in the beginning and 35.5MB in the end (delta: 8.0MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2022-07-23 06:42:04,933 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory was 29.7MB in the beginning and 29.6MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:42:04,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.39ms. Allocated memory is still 60.8MB. Free memory was 43.2MB in the beginning and 36.3MB in the end (delta: 6.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 06:42:04,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.52ms. Allocated memory is still 60.8MB. Free memory was 36.2MB in the beginning and 34.0MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-23 06:42:04,933 INFO L158 Benchmark]: Boogie Preprocessor took 38.32ms. Allocated memory is still 60.8MB. Free memory was 34.0MB in the beginning and 32.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:42:04,933 INFO L158 Benchmark]: RCFGBuilder took 547.78ms. Allocated memory is still 60.8MB. Free memory was 32.1MB in the beginning and 39.8MB in the end (delta: -7.7MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2022-07-23 06:42:04,934 INFO L158 Benchmark]: TraceAbstraction took 101476.14ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 39.2MB in the beginning and 35.5MB in the end (delta: 3.7MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-07-23 06:42:04,934 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 75.5MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:42:04,934 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 48.2MB. Free memory was 29.7MB in the beginning and 29.6MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.39ms. Allocated memory is still 60.8MB. Free memory was 43.2MB in the beginning and 36.3MB in the end (delta: 6.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.52ms. Allocated memory is still 60.8MB. Free memory was 36.2MB in the beginning and 34.0MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.32ms. Allocated memory is still 60.8MB. Free memory was 34.0MB in the beginning and 32.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 547.78ms. Allocated memory is still 60.8MB. Free memory was 32.1MB in the beginning and 39.8MB in the end (delta: -7.7MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * TraceAbstraction took 101476.14ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 39.2MB in the beginning and 35.5MB in the end (delta: 3.7MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 75.5MB. Free memory is still 35.5MB. 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: 101.4s, OverallIterations: 32, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5149 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5149 mSDsluCounter, 10686 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4075 IncrementalHoareTripleChecker+Unchecked, 8248 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6083 IncrementalHoareTripleChecker+Invalid, 10455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 2438 mSDtfsCounter, 6083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1295 GetRequests, 790 SyntacticMatches, 19 SemanticMatches, 486 ConstructedPredicates, 16 IntricatePredicates, 1 DeprecatedPredicates, 2699 ImplicationChecksByTransitivity, 79.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=0, InterpolantAutomatonStates: 297, 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, 31 MinimizatonAttempts, 71 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 80.6s InterpolantComputationTime, 788 NumberOfCodeBlocks, 788 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1145 ConstructedInterpolants, 309 QuantifiedInterpolants, 13514 SizeOfPredicates, 315 NumberOfNonLiveVariables, 3988 ConjunctsInSsa, 540 ConjunctsInUnsatCore, 46 InterpolantComputations, 16 PerfectInterpolantSequences, 100/271 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-23 06:42:04,986 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