./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.3.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 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:35:40,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:35:40,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:35:40,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:35:40,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:35:40,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:35:40,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:35:40,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:35:40,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:35:40,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:35:40,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:35:40,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:35:40,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:35:40,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:35:40,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:35:40,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:35:40,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:35:40,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:35:40,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:35:40,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:35:40,974 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:35:40,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:35:40,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:35:40,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:35:40,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:35:40,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:35:40,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:35:40,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:35:40,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:35:40,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:35:40,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:35:40,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:35:40,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:35:40,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:35:40,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:35:40,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:35:40,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:35:40,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:35:40,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:35:40,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:35:40,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:35:41,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:35:41,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:35:41,031 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:35:41,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:35:41,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:35:41,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:35:41,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:35:41,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:35:41,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:35:41,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:35:41,034 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:35:41,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:35:41,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:35:41,035 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:35:41,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:35:41,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:35:41,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:35:41,036 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:35:41,036 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:35:41,037 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:35:41,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:35:41,038 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:35:41,038 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:35:41,038 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:35:41,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:35:41,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:35:41,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:35:41,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:35:41,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:35:41,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:35:41,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:35:41,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:35:41,040 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 -> 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb [2022-07-20 05:35:41,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:35:41,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:35:41,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:35:41,351 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:35:41,351 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:35:41,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-20 05:35:41,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c737ff00/45809a0f8a904f95b5390fccdc778243/FLAG8ec923d38 [2022-07-20 05:35:41,871 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:35:41,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-20 05:35:41,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c737ff00/45809a0f8a904f95b5390fccdc778243/FLAG8ec923d38 [2022-07-20 05:35:42,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c737ff00/45809a0f8a904f95b5390fccdc778243 [2022-07-20 05:35:42,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:35:42,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:35:42,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:35:42,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:35:42,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:35:42,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa5c39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42, skipping insertion in model container [2022-07-20 05:35:42,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:35:42,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:35:42,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:35:42,481 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:35:42,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:35:42,543 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:35:42,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42 WrapperNode [2022-07-20 05:35:42,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:35:42,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:35:42,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:35:42,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:35:42,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,615 INFO L137 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-07-20 05:35:42,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:35:42,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:35:42,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:35:42,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:35:42,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:35:42,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:35:42,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:35:42,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:35:42,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (1/1) ... [2022-07-20 05:35:42,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:35:42,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:42,713 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-20 05:35:42,737 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-20 05:35:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:35:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:35:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:35:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:35:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:35:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:35:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:35:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:35:42,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:35:42,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:35:42,905 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:35:42,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:35:43,161 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:35:43,168 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:35:43,168 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 05:35:43,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:35:43 BoogieIcfgContainer [2022-07-20 05:35:43,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:35:43,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:35:43,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:35:43,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:35:43,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:35:42" (1/3) ... [2022-07-20 05:35:43,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2f2aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:35:43, skipping insertion in model container [2022-07-20 05:35:43,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:35:42" (2/3) ... [2022-07-20 05:35:43,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2f2aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:35:43, skipping insertion in model container [2022-07-20 05:35:43,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:35:43" (3/3) ... [2022-07-20 05:35:43,179 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2022-07-20 05:35:43,194 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:35:43,195 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-20 05:35:43,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:35:43,271 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@7a325b47, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@cde11f1 [2022-07-20 05:35:43,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-20 05:35:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 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-20 05:35:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 05:35:43,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:43,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 05:35:43,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:43,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2022-07-20 05:35:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:43,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618088826] [2022-07-20 05:35:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:43,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:43,438 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-20 05:35:43,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:43,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618088826] [2022-07-20 05:35:43,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618088826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:43,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:43,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:35:43,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803158801] [2022-07-20 05:35:43,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:43,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 05:35:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 05:35:43,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 05:35:43,484 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:43,504 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-07-20 05:35:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 05:35:43,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-20 05:35:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:43,514 INFO L225 Difference]: With dead ends: 64 [2022-07-20 05:35:43,514 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 05:35:43,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 05:35:43,521 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:43,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:43,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 05:35:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-20 05:35:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 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-20 05:35:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-07-20 05:35:43,559 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2022-07-20 05:35:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:43,559 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-07-20 05:35:43,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-07-20 05:35:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:35:43,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:43,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:43,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:35:43,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2022-07-20 05:35:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:43,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439647027] [2022-07-20 05:35:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:43,640 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-20 05:35:43,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:43,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439647027] [2022-07-20 05:35:43,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439647027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:43,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:43,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:35:43,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338521436] [2022-07-20 05:35:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:43,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:35:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:35:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:35:43,647 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:43,670 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-07-20 05:35:43,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:35:43,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 05:35:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:43,674 INFO L225 Difference]: With dead ends: 63 [2022-07-20 05:35:43,675 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 05:35:43,678 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-20 05:35:43,680 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:43,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 05:35:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-20 05:35:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 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-20 05:35:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2022-07-20 05:35:43,696 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2022-07-20 05:35:43,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:43,697 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-07-20 05:35:43,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-07-20 05:35:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:35:43,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:43,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:43,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:35:43,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2022-07-20 05:35:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:43,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967574997] [2022-07-20 05:35:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:43,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:43,742 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-20 05:35:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:43,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967574997] [2022-07-20 05:35:43,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967574997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:43,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:43,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:35:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924426913] [2022-07-20 05:35:43,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:43,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:35:43,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:43,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:35:43,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:35:43,746 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:43,785 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2022-07-20 05:35:43,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:35:43,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 05:35:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:43,787 INFO L225 Difference]: With dead ends: 111 [2022-07-20 05:35:43,787 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 05:35:43,788 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-20 05:35:43,789 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:43,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 05:35:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2022-07-20 05:35:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 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-20 05:35:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2022-07-20 05:35:43,797 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2022-07-20 05:35:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:43,797 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2022-07-20 05:35:43,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2022-07-20 05:35:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:35:43,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:43,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:43,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:35:43,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:43,803 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2022-07-20 05:35:43,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:43,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886827071] [2022-07-20 05:35:43,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:43,843 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-20 05:35:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:43,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886827071] [2022-07-20 05:35:43,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886827071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:43,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:43,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:35:43,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382341123] [2022-07-20 05:35:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:43,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:35:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:35:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:35:43,846 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:43,909 INFO L93 Difference]: Finished difference Result 148 states and 212 transitions. [2022-07-20 05:35:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:35:43,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:35:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:43,911 INFO L225 Difference]: With dead ends: 148 [2022-07-20 05:35:43,911 INFO L226 Difference]: Without dead ends: 148 [2022-07-20 05:35:43,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:35:43,912 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:43,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 209 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-20 05:35:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2022-07-20 05:35:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 107 states have (on average 1.841121495327103) internal successors, (197), 126 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2022-07-20 05:35:43,923 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 8 [2022-07-20 05:35:43,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:43,924 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2022-07-20 05:35:43,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2022-07-20 05:35:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:35:43,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:43,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:43,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:35:43,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:43,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:43,926 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2022-07-20 05:35:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:43,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638460892] [2022-07-20 05:35:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:43,971 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-20 05:35:43,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:43,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638460892] [2022-07-20 05:35:43,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638460892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:43,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:43,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:35:43,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612728921] [2022-07-20 05:35:43,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:43,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:35:43,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:43,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:35:43,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:35:43,976 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:44,045 INFO L93 Difference]: Finished difference Result 209 states and 319 transitions. [2022-07-20 05:35:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:35:44,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:35:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:44,048 INFO L225 Difference]: With dead ends: 209 [2022-07-20 05:35:44,048 INFO L226 Difference]: Without dead ends: 206 [2022-07-20 05:35:44,048 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-20 05:35:44,049 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:44,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-20 05:35:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 185. [2022-07-20 05:35:44,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 165 states have (on average 1.8363636363636364) internal successors, (303), 184 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 303 transitions. [2022-07-20 05:35:44,064 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 303 transitions. Word has length 8 [2022-07-20 05:35:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:44,079 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 303 transitions. [2022-07-20 05:35:44,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 303 transitions. [2022-07-20 05:35:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:35:44,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:44,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:44,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:35:44,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2022-07-20 05:35:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:44,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722152862] [2022-07-20 05:35:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:44,113 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-20 05:35:44,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:44,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722152862] [2022-07-20 05:35:44,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722152862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:44,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:44,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:35:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858402611] [2022-07-20 05:35:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:44,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:35:44,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:44,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:35:44,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:35:44,116 INFO L87 Difference]: Start difference. First operand 185 states and 303 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:44,189 INFO L93 Difference]: Finished difference Result 261 states and 411 transitions. [2022-07-20 05:35:44,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:35:44,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:35:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:44,192 INFO L225 Difference]: With dead ends: 261 [2022-07-20 05:35:44,192 INFO L226 Difference]: Without dead ends: 261 [2022-07-20 05:35:44,193 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-20 05:35:44,198 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:44,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 171 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-20 05:35:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2022-07-20 05:35:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 222 states have (on average 1.7882882882882882) internal successors, (397), 239 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 397 transitions. [2022-07-20 05:35:44,228 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 397 transitions. Word has length 8 [2022-07-20 05:35:44,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:44,230 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 397 transitions. [2022-07-20 05:35:44,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,230 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 397 transitions. [2022-07-20 05:35:44,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:35:44,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:44,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:44,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:35:44,231 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:44,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:44,232 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2022-07-20 05:35:44,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:44,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972206354] [2022-07-20 05:35:44,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:44,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:44,338 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-20 05:35:44,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:44,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972206354] [2022-07-20 05:35:44,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972206354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:44,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:44,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:35:44,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771074998] [2022-07-20 05:35:44,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:44,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:35:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:35:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:35:44,341 INFO L87 Difference]: Start difference. First operand 240 states and 397 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:44,383 INFO L93 Difference]: Finished difference Result 256 states and 402 transitions. [2022-07-20 05:35:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:35:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:35:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:44,385 INFO L225 Difference]: With dead ends: 256 [2022-07-20 05:35:44,385 INFO L226 Difference]: Without dead ends: 256 [2022-07-20 05:35:44,385 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-20 05:35:44,386 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:44,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-20 05:35:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2022-07-20 05:35:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 222 states have (on average 1.7522522522522523) internal successors, (389), 237 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 389 transitions. [2022-07-20 05:35:44,396 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 389 transitions. Word has length 8 [2022-07-20 05:35:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:44,396 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 389 transitions. [2022-07-20 05:35:44,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 389 transitions. [2022-07-20 05:35:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 05:35:44,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:44,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:44,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:35:44,398 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:44,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2022-07-20 05:35:44,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:44,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792244206] [2022-07-20 05:35:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:44,441 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-20 05:35:44,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:44,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792244206] [2022-07-20 05:35:44,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792244206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:44,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:44,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:35:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030771469] [2022-07-20 05:35:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:44,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:35:44,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:35:44,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:35:44,444 INFO L87 Difference]: Start difference. First operand 238 states and 389 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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-20 05:35:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:44,473 INFO L93 Difference]: Finished difference Result 297 states and 423 transitions. [2022-07-20 05:35:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:35:44,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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-20 05:35:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:44,475 INFO L225 Difference]: With dead ends: 297 [2022-07-20 05:35:44,475 INFO L226 Difference]: Without dead ends: 297 [2022-07-20 05:35:44,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:35:44,476 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 105 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:44,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 279 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-20 05:35:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 195. [2022-07-20 05:35:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.6994535519125684) internal successors, (311), 194 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 311 transitions. [2022-07-20 05:35:44,483 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 311 transitions. Word has length 9 [2022-07-20 05:35:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:44,483 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 311 transitions. [2022-07-20 05:35:44,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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-20 05:35:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 311 transitions. [2022-07-20 05:35:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:35:44,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:44,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:44,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:35:44,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:44,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:44,485 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2022-07-20 05:35:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:44,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72851769] [2022-07-20 05:35:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:44,507 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-20 05:35:44,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:44,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72851769] [2022-07-20 05:35:44,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72851769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:35:44,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:35:44,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:35:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722844967] [2022-07-20 05:35:44,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:44,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:35:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:35:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:35:44,510 INFO L87 Difference]: Start difference. First operand 195 states and 311 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-20 05:35:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:44,534 INFO L93 Difference]: Finished difference Result 418 states and 615 transitions. [2022-07-20 05:35:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:35:44,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-20 05:35:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:44,537 INFO L225 Difference]: With dead ends: 418 [2022-07-20 05:35:44,537 INFO L226 Difference]: Without dead ends: 418 [2022-07-20 05:35:44,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:35:44,538 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 107 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:44,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 236 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-20 05:35:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 278. [2022-07-20 05:35:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 266 states have (on average 1.6090225563909775) internal successors, (428), 277 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 428 transitions. [2022-07-20 05:35:44,545 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 428 transitions. Word has length 10 [2022-07-20 05:35:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:44,545 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 428 transitions. [2022-07-20 05:35:44,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-20 05:35:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 428 transitions. [2022-07-20 05:35:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:35:44,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:44,547 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:44,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:35:44,547 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:44,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2022-07-20 05:35:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:44,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899061399] [2022-07-20 05:35:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:44,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899061399] [2022-07-20 05:35:44,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899061399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:44,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902162288] [2022-07-20 05:35:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:44,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:44,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:44,619 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-20 05:35:44,621 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-20 05:35:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:44,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:35:44,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:44,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:44,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902162288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:44,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:44,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-20 05:35:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327196958] [2022-07-20 05:35:44,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:44,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:35:44,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:44,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:35:44,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:35:44,880 INFO L87 Difference]: Start difference. First operand 278 states and 428 transitions. Second operand has 7 states, 7 states have (on average 4.0) 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-20 05:35:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:44,914 INFO L93 Difference]: Finished difference Result 282 states and 418 transitions. [2022-07-20 05:35:44,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:35:44,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) 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 16 [2022-07-20 05:35:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:44,915 INFO L225 Difference]: With dead ends: 282 [2022-07-20 05:35:44,916 INFO L226 Difference]: Without dead ends: 282 [2022-07-20 05:35:44,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:35:44,917 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 231 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:44,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 289 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-20 05:35:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2022-07-20 05:35:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 262 states have (on average 1.5877862595419847) internal successors, (416), 273 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 416 transitions. [2022-07-20 05:35:44,922 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 416 transitions. Word has length 16 [2022-07-20 05:35:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:44,922 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 416 transitions. [2022-07-20 05:35:44,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) 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-20 05:35:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 416 transitions. [2022-07-20 05:35:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:35:44,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:44,923 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:44,956 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-20 05:35:45,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-20 05:35:45,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1902356162, now seen corresponding path program 1 times [2022-07-20 05:35:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:45,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975716595] [2022-07-20 05:35:45,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:45,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:45,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:45,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975716595] [2022-07-20 05:35:45,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975716595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:45,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874039621] [2022-07-20 05:35:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:45,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:45,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:45,205 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-20 05:35:45,207 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-20 05:35:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:45,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:35:45,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:45,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:45,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874039621] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:45,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:45,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-20 05:35:45,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685261898] [2022-07-20 05:35:45,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:45,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:35:45,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:45,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:35:45,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:35:45,384 INFO L87 Difference]: Start difference. First operand 274 states and 416 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 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-20 05:35:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:45,456 INFO L93 Difference]: Finished difference Result 613 states and 869 transitions. [2022-07-20 05:35:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:35:45,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 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 16 [2022-07-20 05:35:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:45,460 INFO L225 Difference]: With dead ends: 613 [2022-07-20 05:35:45,460 INFO L226 Difference]: Without dead ends: 613 [2022-07-20 05:35:45,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:35:45,462 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 295 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:45,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 472 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-07-20 05:35:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 387. [2022-07-20 05:35:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 375 states have (on average 1.5333333333333334) internal successors, (575), 386 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 575 transitions. [2022-07-20 05:35:45,472 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 575 transitions. Word has length 16 [2022-07-20 05:35:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:45,472 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 575 transitions. [2022-07-20 05:35:45,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 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-20 05:35:45,473 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 575 transitions. [2022-07-20 05:35:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 05:35:45,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:45,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:45,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:35:45,691 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,SelfDestructingSolverStorable10 [2022-07-20 05:35:45,692 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash 53823374, now seen corresponding path program 2 times [2022-07-20 05:35:45,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:45,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534530226] [2022-07-20 05:35:45,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:45,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:45,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534530226] [2022-07-20 05:35:45,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534530226] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:45,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894741361] [2022-07-20 05:35:45,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:35:45,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:45,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:45,729 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-20 05:35:45,730 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-20 05:35:45,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:35:45,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:35:45,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:35:45,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 05:35:45,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 05:35:45,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894741361] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:45,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:45,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9 [2022-07-20 05:35:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829398644] [2022-07-20 05:35:45,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:45,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:35:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:45,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:35:45,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:35:45,904 INFO L87 Difference]: Start difference. First operand 387 states and 575 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:45,994 INFO L93 Difference]: Finished difference Result 831 states and 1155 transitions. [2022-07-20 05:35:45,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:35:45,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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-20 05:35:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:45,997 INFO L225 Difference]: With dead ends: 831 [2022-07-20 05:35:45,998 INFO L226 Difference]: Without dead ends: 831 [2022-07-20 05:35:45,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:35:45,999 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 446 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:45,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 601 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-07-20 05:35:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 468. [2022-07-20 05:35:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 456 states have (on average 1.5043859649122806) internal successors, (686), 467 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 686 transitions. [2022-07-20 05:35:46,008 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 686 transitions. Word has length 22 [2022-07-20 05:35:46,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:46,009 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 686 transitions. [2022-07-20 05:35:46,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 686 transitions. [2022-07-20 05:35:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:35:46,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:46,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:46,044 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-20 05:35:46,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:46,232 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:46,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:46,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2107196217, now seen corresponding path program 1 times [2022-07-20 05:35:46,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:46,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401800870] [2022-07-20 05:35:46,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:46,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:46,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:46,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401800870] [2022-07-20 05:35:46,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401800870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:46,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317651044] [2022-07-20 05:35:46,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:46,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:46,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:46,276 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-20 05:35:46,303 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-20 05:35:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:46,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:35:46,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:46,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:46,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317651044] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:46,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:46,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-07-20 05:35:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098847493] [2022-07-20 05:35:46,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:46,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:35:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:46,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:35:46,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:35:46,439 INFO L87 Difference]: Start difference. First operand 468 states and 686 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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-20 05:35:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:46,497 INFO L93 Difference]: Finished difference Result 1116 states and 1618 transitions. [2022-07-20 05:35:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:35:46,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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 24 [2022-07-20 05:35:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:46,502 INFO L225 Difference]: With dead ends: 1116 [2022-07-20 05:35:46,502 INFO L226 Difference]: Without dead ends: 1116 [2022-07-20 05:35:46,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:35:46,503 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 173 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:46,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 163 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-20 05:35:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 995. [2022-07-20 05:35:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 983 states have (on average 1.4933875890132249) internal successors, (1468), 994 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1468 transitions. [2022-07-20 05:35:46,521 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1468 transitions. Word has length 24 [2022-07-20 05:35:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:46,522 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1468 transitions. [2022-07-20 05:35:46,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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-20 05:35:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1468 transitions. [2022-07-20 05:35:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:35:46,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:46,523 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:46,547 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-20 05:35:46,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:46,739 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:46,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2022-07-20 05:35:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:46,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342801131] [2022-07-20 05:35:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:46,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:46,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342801131] [2022-07-20 05:35:46,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342801131] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:46,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53021817] [2022-07-20 05:35:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:46,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:46,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:46,798 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-20 05:35:46,800 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-20 05:35:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:46,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:35:46,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:46,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:46,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53021817] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:46,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:46,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-20 05:35:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072765736] [2022-07-20 05:35:46,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:46,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:35:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:46,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:35:46,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:35:46,964 INFO L87 Difference]: Start difference. First operand 995 states and 1468 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:47,105 INFO L93 Difference]: Finished difference Result 3487 states and 4850 transitions. [2022-07-20 05:35:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:35:47,105 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 27 [2022-07-20 05:35:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:47,118 INFO L225 Difference]: With dead ends: 3487 [2022-07-20 05:35:47,118 INFO L226 Difference]: Without dead ends: 3487 [2022-07-20 05:35:47,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:35:47,119 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 441 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:47,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 554 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2022-07-20 05:35:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 2363. [2022-07-20 05:35:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2351 states have (on average 1.4427903019991493) internal successors, (3392), 2362 states have internal predecessors, (3392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3392 transitions. [2022-07-20 05:35:47,185 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3392 transitions. Word has length 27 [2022-07-20 05:35:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:47,186 INFO L495 AbstractCegarLoop]: Abstraction has 2363 states and 3392 transitions. [2022-07-20 05:35:47,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3392 transitions. [2022-07-20 05:35:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:35:47,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:47,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:47,209 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-20 05:35:47,403 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,SelfDestructingSolverStorable13 [2022-07-20 05:35:47,404 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:47,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash 334990594, now seen corresponding path program 1 times [2022-07-20 05:35:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:47,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009023123] [2022-07-20 05:35:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:35:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:47,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009023123] [2022-07-20 05:35:47,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009023123] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:47,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100331138] [2022-07-20 05:35:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:47,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:47,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:47,453 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-20 05:35:47,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-20 05:35:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:47,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:35:47,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:35:47,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:35:47,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100331138] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:47,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:47,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-20 05:35:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397720579] [2022-07-20 05:35:47,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:47,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:35:47,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:47,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:35:47,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:35:47,591 INFO L87 Difference]: Start difference. First operand 2363 states and 3392 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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-20 05:35:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:47,647 INFO L93 Difference]: Finished difference Result 1756 states and 2405 transitions. [2022-07-20 05:35:47,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:35:47,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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 27 [2022-07-20 05:35:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:47,653 INFO L225 Difference]: With dead ends: 1756 [2022-07-20 05:35:47,654 INFO L226 Difference]: Without dead ends: 1756 [2022-07-20 05:35:47,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:35:47,655 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 346 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:47,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 532 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-07-20 05:35:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1081. [2022-07-20 05:35:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1069 states have (on average 1.4069223573433116) internal successors, (1504), 1080 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1504 transitions. [2022-07-20 05:35:47,676 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1504 transitions. Word has length 27 [2022-07-20 05:35:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:47,676 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1504 transitions. [2022-07-20 05:35:47,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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-20 05:35:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1504 transitions. [2022-07-20 05:35:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 05:35:47,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:47,678 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:47,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-20 05:35:47,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-20 05:35:47,883 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:47,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2022-07-20 05:35:47,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:47,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884511004] [2022-07-20 05:35:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-20 05:35:47,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:47,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884511004] [2022-07-20 05:35:47,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884511004] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:47,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124451905] [2022-07-20 05:35:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:47,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:47,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:47,977 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-20 05:35:47,977 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-20 05:35:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:48,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:35:48,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:48,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:35:48,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124451905] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:48,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:48,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2022-07-20 05:35:48,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439317162] [2022-07-20 05:35:48,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:48,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:35:48,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:35:48,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:35:48,239 INFO L87 Difference]: Start difference. First operand 1081 states and 1504 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 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-20 05:35:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:48,533 INFO L93 Difference]: Finished difference Result 3000 states and 3991 transitions. [2022-07-20 05:35:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 05:35:48,533 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 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 51 [2022-07-20 05:35:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:48,542 INFO L225 Difference]: With dead ends: 3000 [2022-07-20 05:35:48,543 INFO L226 Difference]: Without dead ends: 3000 [2022-07-20 05:35:48,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:35:48,544 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1176 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:48,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1056 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:48,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2022-07-20 05:35:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1204. [2022-07-20 05:35:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1192 states have (on average 1.4236577181208054) internal successors, (1697), 1203 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1697 transitions. [2022-07-20 05:35:48,577 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1697 transitions. Word has length 51 [2022-07-20 05:35:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:48,577 INFO L495 AbstractCegarLoop]: Abstraction has 1204 states and 1697 transitions. [2022-07-20 05:35:48,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 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-20 05:35:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1697 transitions. [2022-07-20 05:35:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 05:35:48,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:48,579 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:48,603 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-20 05:35:48,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:48,796 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2022-07-20 05:35:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:48,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735450685] [2022-07-20 05:35:48,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-20 05:35:48,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:48,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735450685] [2022-07-20 05:35:48,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735450685] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:48,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700771121] [2022-07-20 05:35:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:48,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:48,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:48,857 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-20 05:35:48,883 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-20 05:35:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:48,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:35:48,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 05:35:49,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 05:35:49,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700771121] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:49,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:35:49,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2022-07-20 05:35:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641934503] [2022-07-20 05:35:49,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:35:49,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:35:49,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:49,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:35:49,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:35:49,053 INFO L87 Difference]: Start difference. First operand 1204 states and 1697 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:49,166 INFO L93 Difference]: Finished difference Result 2838 states and 3879 transitions. [2022-07-20 05:35:49,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:35:49,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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 59 [2022-07-20 05:35:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:49,176 INFO L225 Difference]: With dead ends: 2838 [2022-07-20 05:35:49,177 INFO L226 Difference]: Without dead ends: 2838 [2022-07-20 05:35:49,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:35:49,177 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 269 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:49,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 385 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2022-07-20 05:35:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2004. [2022-07-20 05:35:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1992 states have (on average 1.3995983935742973) internal successors, (2788), 2003 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2788 transitions. [2022-07-20 05:35:49,217 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2788 transitions. Word has length 59 [2022-07-20 05:35:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:49,217 INFO L495 AbstractCegarLoop]: Abstraction has 2004 states and 2788 transitions. [2022-07-20 05:35:49,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2788 transitions. [2022-07-20 05:35:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 05:35:49,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:49,219 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:49,247 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-20 05:35:49,435 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,SelfDestructingSolverStorable16 [2022-07-20 05:35:49,436 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:49,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2022-07-20 05:35:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:49,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588362131] [2022-07-20 05:35:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 05:35:49,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:49,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588362131] [2022-07-20 05:35:49,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588362131] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:49,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064685020] [2022-07-20 05:35:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:49,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:49,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:49,526 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-20 05:35:49,527 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-20 05:35:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:49,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:35:49,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-20 05:35:49,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-20 05:35:49,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064685020] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:49,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:49,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2022-07-20 05:35:49,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084271632] [2022-07-20 05:35:49,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:49,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:35:49,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:49,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:35:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:35:49,718 INFO L87 Difference]: Start difference. First operand 2004 states and 2788 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 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-20 05:35:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:50,784 INFO L93 Difference]: Finished difference Result 11354 states and 15589 transitions. [2022-07-20 05:35:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-20 05:35:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 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) Word has length 59 [2022-07-20 05:35:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:50,823 INFO L225 Difference]: With dead ends: 11354 [2022-07-20 05:35:50,823 INFO L226 Difference]: Without dead ends: 11354 [2022-07-20 05:35:50,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2022-07-20 05:35:50,825 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 1148 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:50,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 801 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 05:35:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11354 states. [2022-07-20 05:35:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11354 to 5913. [2022-07-20 05:35:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5913 states, 5902 states have (on average 1.423246357167062) internal successors, (8400), 5912 states have internal predecessors, (8400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 8400 transitions. [2022-07-20 05:35:50,974 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 8400 transitions. Word has length 59 [2022-07-20 05:35:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:50,974 INFO L495 AbstractCegarLoop]: Abstraction has 5913 states and 8400 transitions. [2022-07-20 05:35:50,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 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-20 05:35:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 8400 transitions. [2022-07-20 05:35:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 05:35:50,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:50,976 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:51,004 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-20 05:35:51,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 05:35:51,202 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:51,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2022-07-20 05:35:51,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:51,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205214519] [2022-07-20 05:35:51,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:51,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-20 05:35:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:51,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205214519] [2022-07-20 05:35:51,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205214519] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:51,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854268034] [2022-07-20 05:35:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:51,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:51,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:51,297 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-20 05:35:51,297 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-20 05:35:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:51,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:35:51,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 05:35:51,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 05:35:51,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854268034] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:51,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:51,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2022-07-20 05:35:51,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199084419] [2022-07-20 05:35:51,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:51,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:35:51,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:51,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:35:51,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:35:51,533 INFO L87 Difference]: Start difference. First operand 5913 states and 8400 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 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-20 05:35:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:52,118 INFO L93 Difference]: Finished difference Result 13135 states and 18181 transitions. [2022-07-20 05:35:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 05:35:52,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 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) Word has length 63 [2022-07-20 05:35:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:52,147 INFO L225 Difference]: With dead ends: 13135 [2022-07-20 05:35:52,147 INFO L226 Difference]: Without dead ends: 13135 [2022-07-20 05:35:52,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2022-07-20 05:35:52,148 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 1173 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:52,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 1196 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:35:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13135 states. [2022-07-20 05:35:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13135 to 5663. [2022-07-20 05:35:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5663 states, 5652 states have (on average 1.3982661004953998) internal successors, (7903), 5662 states have internal predecessors, (7903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5663 states to 5663 states and 7903 transitions. [2022-07-20 05:35:52,298 INFO L78 Accepts]: Start accepts. Automaton has 5663 states and 7903 transitions. Word has length 63 [2022-07-20 05:35:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:52,298 INFO L495 AbstractCegarLoop]: Abstraction has 5663 states and 7903 transitions. [2022-07-20 05:35:52,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 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-20 05:35:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 5663 states and 7903 transitions. [2022-07-20 05:35:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-20 05:35:52,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:52,300 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 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-20 05:35:52,329 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-20 05:35:52,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:52,516 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2022-07-20 05:35:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:52,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764841582] [2022-07-20 05:35:52,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:52,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 05:35:52,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:52,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764841582] [2022-07-20 05:35:52,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764841582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:52,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698440613] [2022-07-20 05:35:52,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:52,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:52,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:52,613 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-20 05:35:52,636 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-20 05:35:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:52,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 05:35:52,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-20 05:35:52,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-20 05:35:52,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698440613] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:52,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:52,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-20 05:35:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893514062] [2022-07-20 05:35:52,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:52,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:35:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:35:52,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:35:52,857 INFO L87 Difference]: Start difference. First operand 5663 states and 7903 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:53,095 INFO L93 Difference]: Finished difference Result 4879 states and 6428 transitions. [2022-07-20 05:35:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:35:53,096 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-20 05:35:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:53,105 INFO L225 Difference]: With dead ends: 4879 [2022-07-20 05:35:53,105 INFO L226 Difference]: Without dead ends: 4879 [2022-07-20 05:35:53,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-07-20 05:35:53,107 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 929 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:53,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1479 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2022-07-20 05:35:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 3657. [2022-07-20 05:35:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3657 states, 3646 states have (on average 1.3167855183763029) internal successors, (4801), 3656 states have internal predecessors, (4801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4801 transitions. [2022-07-20 05:35:53,181 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4801 transitions. Word has length 63 [2022-07-20 05:35:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:53,181 INFO L495 AbstractCegarLoop]: Abstraction has 3657 states and 4801 transitions. [2022-07-20 05:35:53,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4801 transitions. [2022-07-20 05:35:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 05:35:53,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:53,182 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:53,211 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-20 05:35:53,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:53,395 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2022-07-20 05:35:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:53,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232719909] [2022-07-20 05:35:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-20 05:35:53,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:53,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232719909] [2022-07-20 05:35:53,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232719909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:53,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396396760] [2022-07-20 05:35:53,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:53,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:53,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:53,472 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-20 05:35:53,480 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-20 05:35:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:53,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:35:53,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-20 05:35:53,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-20 05:35:53,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396396760] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:53,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:53,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-20 05:35:53,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628154805] [2022-07-20 05:35:53,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:53,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:35:53,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:53,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:35:53,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:35:53,690 INFO L87 Difference]: Start difference. First operand 3657 states and 4801 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:53,750 INFO L93 Difference]: Finished difference Result 3649 states and 4758 transitions. [2022-07-20 05:35:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:35:53,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 64 [2022-07-20 05:35:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:53,762 INFO L225 Difference]: With dead ends: 3649 [2022-07-20 05:35:53,762 INFO L226 Difference]: Without dead ends: 3649 [2022-07-20 05:35:53,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:35:53,763 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 107 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:53,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 253 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:35:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2022-07-20 05:35:53,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3642. [2022-07-20 05:35:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3642 states, 3631 states have (on average 1.3098320022032497) internal successors, (4756), 3641 states have internal predecessors, (4756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4756 transitions. [2022-07-20 05:35:53,833 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4756 transitions. Word has length 64 [2022-07-20 05:35:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:53,833 INFO L495 AbstractCegarLoop]: Abstraction has 3642 states and 4756 transitions. [2022-07-20 05:35:53,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4756 transitions. [2022-07-20 05:35:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 05:35:53,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:53,835 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:53,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 05:35:54,060 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,SelfDestructingSolverStorable20 [2022-07-20 05:35:54,060 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:54,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1737502264, now seen corresponding path program 1 times [2022-07-20 05:35:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:54,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500332212] [2022-07-20 05:35:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-20 05:35:54,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:54,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500332212] [2022-07-20 05:35:54,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500332212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:54,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368980893] [2022-07-20 05:35:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:54,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:54,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:54,142 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-20 05:35:54,143 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-20 05:35:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:54,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:35:54,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 05:35:54,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 97 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 05:35:54,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368980893] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:54,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:54,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2022-07-20 05:35:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878467709] [2022-07-20 05:35:54,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:54,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:35:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:54,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:35:54,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:35:54,429 INFO L87 Difference]: Start difference. First operand 3642 states and 4756 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:54,717 INFO L93 Difference]: Finished difference Result 5049 states and 6651 transitions. [2022-07-20 05:35:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:35:54,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-20 05:35:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:54,729 INFO L225 Difference]: With dead ends: 5049 [2022-07-20 05:35:54,729 INFO L226 Difference]: Without dead ends: 5049 [2022-07-20 05:35:54,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-07-20 05:35:54,730 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 439 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:54,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 621 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5049 states. [2022-07-20 05:35:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5049 to 2736. [2022-07-20 05:35:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 2725 states have (on average 1.3056880733944953) internal successors, (3558), 2735 states have internal predecessors, (3558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3558 transitions. [2022-07-20 05:35:54,783 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3558 transitions. Word has length 65 [2022-07-20 05:35:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:54,783 INFO L495 AbstractCegarLoop]: Abstraction has 2736 states and 3558 transitions. [2022-07-20 05:35:54,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3558 transitions. [2022-07-20 05:35:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-20 05:35:54,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:54,784 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 4, 3, 3, 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-20 05:35:54,811 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-20 05:35:54,998 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,SelfDestructingSolverStorable21 [2022-07-20 05:35:54,998 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:54,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1937207539, now seen corresponding path program 1 times [2022-07-20 05:35:54,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:54,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654419720] [2022-07-20 05:35:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:54,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-20 05:35:55,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:55,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654419720] [2022-07-20 05:35:55,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654419720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:55,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726933259] [2022-07-20 05:35:55,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:55,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:55,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:55,064 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:35:55,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 05:35:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:55,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:35:55,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:55,178 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-20 05:35:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-20 05:35:55,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-20 05:35:55,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726933259] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:55,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:55,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-20 05:35:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151036660] [2022-07-20 05:35:55,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:55,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:35:55,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:35:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:35:55,627 INFO L87 Difference]: Start difference. First operand 2736 states and 3558 transitions. Second operand has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:55,900 INFO L93 Difference]: Finished difference Result 4740 states and 6100 transitions. [2022-07-20 05:35:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:35:55,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-07-20 05:35:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:55,910 INFO L225 Difference]: With dead ends: 4740 [2022-07-20 05:35:55,910 INFO L226 Difference]: Without dead ends: 4740 [2022-07-20 05:35:55,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:35:55,911 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 726 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:55,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 465 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:35:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4740 states. [2022-07-20 05:35:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4740 to 3702. [2022-07-20 05:35:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 3691 states have (on average 1.3270116499593607) internal successors, (4898), 3701 states have internal predecessors, (4898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 4898 transitions. [2022-07-20 05:35:55,976 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 4898 transitions. Word has length 69 [2022-07-20 05:35:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:55,976 INFO L495 AbstractCegarLoop]: Abstraction has 3702 states and 4898 transitions. [2022-07-20 05:35:55,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 4898 transitions. [2022-07-20 05:35:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 05:35:55,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:55,978 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 8, 6, 6, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:56,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 05:35:56,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:56,199 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1779624174, now seen corresponding path program 1 times [2022-07-20 05:35:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:56,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648196564] [2022-07-20 05:35:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-20 05:35:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:35:56,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648196564] [2022-07-20 05:35:56,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648196564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:35:56,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119939259] [2022-07-20 05:35:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:56,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:56,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:35:56,272 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:35:56,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 05:35:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:35:56,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:35:56,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:35:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 29 proven. 65 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-20 05:35:56,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:35:56,589 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 29 proven. 65 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-20 05:35:56,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119939259] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:35:56,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:35:56,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-07-20 05:35:56,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262310529] [2022-07-20 05:35:56,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:35:56,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:35:56,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:35:56,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:35:56,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:35:56,591 INFO L87 Difference]: Start difference. First operand 3702 states and 4898 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:35:56,851 INFO L93 Difference]: Finished difference Result 11141 states and 13886 transitions. [2022-07-20 05:35:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:35:56,851 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 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 88 [2022-07-20 05:35:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:35:56,872 INFO L225 Difference]: With dead ends: 11141 [2022-07-20 05:35:56,872 INFO L226 Difference]: Without dead ends: 11141 [2022-07-20 05:35:56,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:35:56,873 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 1204 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:35:56,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 1292 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:35:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11141 states. [2022-07-20 05:35:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11141 to 5772. [2022-07-20 05:35:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5772 states, 5761 states have (on average 1.3070647457038709) internal successors, (7530), 5771 states have internal predecessors, (7530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 7530 transitions. [2022-07-20 05:35:56,965 INFO L78 Accepts]: Start accepts. Automaton has 5772 states and 7530 transitions. Word has length 88 [2022-07-20 05:35:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:35:56,965 INFO L495 AbstractCegarLoop]: Abstraction has 5772 states and 7530 transitions. [2022-07-20 05:35:56,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:35:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5772 states and 7530 transitions. [2022-07-20 05:35:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-20 05:35:56,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:35:56,968 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:35:56,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 05:35:57,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:35:57,185 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:35:57,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:35:57,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1011471400, now seen corresponding path program 1 times [2022-07-20 05:35:57,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:35:57,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109011918] [2022-07-20 05:35:57,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:35:57,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:35:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:35:57,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 05:35:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:35:57,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 05:35:57,292 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 05:35:57,293 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-07-20 05:35:57,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-07-20 05:35:57,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-07-20 05:35:57,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-07-20 05:35:57,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-07-20 05:35:57,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-07-20 05:35:57,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-07-20 05:35:57,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-07-20 05:35:57,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-07-20 05:35:57,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2022-07-20 05:35:57,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2022-07-20 05:35:57,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2022-07-20 05:35:57,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-07-20 05:35:57,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-07-20 05:35:57,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-07-20 05:35:57,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-07-20 05:35:57,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-07-20 05:35:57,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2022-07-20 05:35:57,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2022-07-20 05:35:57,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2022-07-20 05:35:57,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 05:35:57,302 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] [2022-07-20 05:35:57,305 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 05:35:57,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:35:57 BoogieIcfgContainer [2022-07-20 05:35:57,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 05:35:57,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 05:35:57,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 05:35:57,374 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 05:35:57,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:35:43" (3/4) ... [2022-07-20 05:35:57,376 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 05:35:57,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 05:35:57,377 INFO L158 Benchmark]: Toolchain (without parser) took 15172.67ms. Allocated memory was 86.0MB in the beginning and 251.7MB in the end (delta: 165.7MB). Free memory was 46.2MB in the beginning and 157.3MB in the end (delta: -111.1MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2022-07-20 05:35:57,377 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory is still 63.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:35:57,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.14ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 46.0MB in the beginning and 89.9MB in the end (delta: -43.9MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-07-20 05:35:57,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.08ms. Allocated memory is still 119.5MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:35:57,378 INFO L158 Benchmark]: Boogie Preprocessor took 53.48ms. Allocated memory is still 119.5MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:35:57,378 INFO L158 Benchmark]: RCFGBuilder took 499.41ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 70.1MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-20 05:35:57,379 INFO L158 Benchmark]: TraceAbstraction took 14201.14ms. Allocated memory was 119.5MB in the beginning and 251.7MB in the end (delta: 132.1MB). Free memory was 68.9MB in the beginning and 158.3MB in the end (delta: -89.4MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2022-07-20 05:35:57,379 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 251.7MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:35:57,380 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.18ms. Allocated memory is still 86.0MB. Free memory is still 63.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.14ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 46.0MB in the beginning and 89.9MB in the end (delta: -43.9MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.08ms. Allocated memory is still 119.5MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.48ms. Allocated memory is still 119.5MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.41ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 70.1MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14201.14ms. Allocated memory was 119.5MB in the beginning and 251.7MB in the end (delta: 132.1MB). Free memory was 68.9MB in the beginning and 158.3MB in the end (delta: -89.4MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 251.7MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=6, pc4=1, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=2, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: VAL [garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L572] COND FALSE !(t4 == ((void *)0)) VAL [garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=3, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L576] EXPR t4->next VAL [garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, t4->next={0:0}, x1={-2:0}, x4={0:0}] [L576] x4 = t4->next [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=4, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: [L578] case 4: VAL [garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L579] COND TRUE S == t4 [L580] S = x4 VAL [garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - 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: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9617 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9617 mSDsluCounter, 11724 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8742 mSDsCounter, 578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2393 IncrementalHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 578 mSolverCounterUnsat, 2982 mSDtfsCounter, 2393 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1768 GetRequests, 1451 SyntacticMatches, 21 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5913occurred in iteration=18, InterpolantAutomatonStates: 265, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 28350 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1594 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2155 ConstructedInterpolants, 0 QuantifiedInterpolants, 7063 SizeOfPredicates, 64 NumberOfNonLiveVariables, 3269 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 54 InterpolantComputations, 10 PerfectInterpolantSequences, 2888/3753 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-20 05:35:57,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/memsafety/lockfree-3.3.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 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:35:59,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:35:59,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:35:59,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:35:59,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:35:59,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:35:59,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:35:59,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:35:59,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:35:59,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:35:59,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:35:59,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:35:59,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:35:59,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:35:59,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:35:59,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:35:59,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:35:59,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:35:59,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:35:59,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:35:59,472 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:35:59,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:35:59,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:35:59,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:35:59,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:35:59,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:35:59,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:35:59,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:35:59,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:35:59,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:35:59,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:35:59,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:35:59,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:35:59,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:35:59,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:35:59,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:35:59,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:35:59,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:35:59,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:35:59,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:35:59,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:35:59,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:35:59,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 05:35:59,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:35:59,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:35:59,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:35:59,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:35:59,528 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:35:59,528 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:35:59,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:35:59,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:35:59,529 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:35:59,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:35:59,530 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:35:59,530 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:35:59,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:35:59,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:35:59,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:35:59,531 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:35:59,531 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:35:59,531 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:35:59,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:35:59,532 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:35:59,532 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:35:59,532 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:35:59,532 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:35:59,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:35:59,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:35:59,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:35:59,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:35:59,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:35:59,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:35:59,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:35:59,534 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:35:59,534 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:35:59,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:35:59,535 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 -> 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb [2022-07-20 05:35:59,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:35:59,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:35:59,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:35:59,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:35:59,867 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:35:59,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-20 05:35:59,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e502ecf53/ec0a9372c28e415daad0755f3e2278d3/FLAG12151a506 [2022-07-20 05:36:00,438 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:36:00,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-20 05:36:00,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e502ecf53/ec0a9372c28e415daad0755f3e2278d3/FLAG12151a506 [2022-07-20 05:36:00,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e502ecf53/ec0a9372c28e415daad0755f3e2278d3 [2022-07-20 05:36:00,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:36:00,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:36:00,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:36:00,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:36:00,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:36:00,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:00" (1/1) ... [2022-07-20 05:36:00,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b6f4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:00, skipping insertion in model container [2022-07-20 05:36:00,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:00" (1/1) ... [2022-07-20 05:36:00,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:36:00,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:36:01,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:36:01,184 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:36:01,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:36:01,276 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:36:01,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01 WrapperNode [2022-07-20 05:36:01,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:36:01,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:36:01,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:36:01,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:36:01,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (1/1) ... [2022-07-20 05:36:01,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (1/1) ... [2022-07-20 05:36:01,351 INFO L137 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-07-20 05:36:01,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:36:01,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:36:01,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:36:01,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:36:01,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (1/1) ... [2022-07-20 05:36:01,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (1/1) ... [2022-07-20 05:36:01,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (1/1) ... [2022-07-20 05:36:01,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (1/1) ... [2022-07-20 05:36:01,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (1/1) ... [2022-07-20 05:36:01,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (1/1) ... [2022-07-20 05:36:01,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (1/1) ... [2022-07-20 05:36:01,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:36:01,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:36:01,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:36:01,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:36:01,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (1/1) ... [2022-07-20 05:36:01,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:36:01,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:36:01,449 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-20 05:36:01,471 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-20 05:36:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 05:36:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:36:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:36:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:36:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:36:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:36:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 05:36:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 05:36:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:36:01,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:36:01,576 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:36:01,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:36:01,923 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:36:01,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:36:01,930 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 05:36:01,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:01 BoogieIcfgContainer [2022-07-20 05:36:01,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:36:01,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:36:01,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:36:01,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:36:01,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:36:00" (1/3) ... [2022-07-20 05:36:01,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cf536f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:01, skipping insertion in model container [2022-07-20 05:36:01,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:01" (2/3) ... [2022-07-20 05:36:01,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cf536f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:01, skipping insertion in model container [2022-07-20 05:36:01,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:01" (3/3) ... [2022-07-20 05:36:01,939 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2022-07-20 05:36:01,952 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:36:01,952 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-20 05:36:01,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:36:01,997 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@a1060dd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a515a92 [2022-07-20 05:36:01,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-20 05:36:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 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-20 05:36:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 05:36:02,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:02,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 05:36:02,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:02,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:02,029 INFO L85 PathProgramCache]: Analyzing trace with hash 28701640, now seen corresponding path program 1 times [2022-07-20 05:36:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:02,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765002422] [2022-07-20 05:36:02,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:02,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:02,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:02,047 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-20 05:36:02,056 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-20 05:36:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:02,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 05:36:02,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:02,220 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-20 05:36:02,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:02,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:02,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765002422] [2022-07-20 05:36:02,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765002422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:02,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:02,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:36:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3865822] [2022-07-20 05:36:02,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:02,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:02,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:02,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:02,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:02,260 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:02,340 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2022-07-20 05:36:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-20 05:36:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:02,352 INFO L225 Difference]: With dead ends: 107 [2022-07-20 05:36:02,353 INFO L226 Difference]: Without dead ends: 105 [2022-07-20 05:36:02,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:02,358 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:02,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-20 05:36:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-07-20 05:36:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 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-20 05:36:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2022-07-20 05:36:02,401 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 5 [2022-07-20 05:36:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:02,402 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2022-07-20 05:36:02,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2022-07-20 05:36:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:36:02,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:02,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:36:02,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:02,612 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-20 05:36:02,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 889749439, now seen corresponding path program 1 times [2022-07-20 05:36:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:02,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207677646] [2022-07-20 05:36:02,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:02,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:02,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:02,619 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-20 05:36:02,620 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-20 05:36:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:02,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 05:36:02,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:02,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-20 05:36:02,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:02,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:02,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207677646] [2022-07-20 05:36:02,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207677646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:02,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:02,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:36:02,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810603371] [2022-07-20 05:36:02,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:02,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:02,702 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:02,832 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2022-07-20 05:36:02,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:02,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 05:36:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:02,834 INFO L225 Difference]: With dead ends: 163 [2022-07-20 05:36:02,835 INFO L226 Difference]: Without dead ends: 160 [2022-07-20 05:36:02,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-20 05:36:02,836 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:02,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:36:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-20 05:36:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2022-07-20 05:36:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2022-07-20 05:36:02,858 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 6 [2022-07-20 05:36:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:02,858 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2022-07-20 05:36:02,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2022-07-20 05:36:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:36:02,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:02,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:36:02,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-20 05:36:03,069 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-20 05:36:03,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2022-07-20 05:36:03,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:03,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061181680] [2022-07-20 05:36:03,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:03,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:03,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:03,073 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-20 05:36:03,075 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-20 05:36:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:03,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 05:36:03,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:03,183 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-20 05:36:03,189 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-20 05:36:03,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:03,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:03,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061181680] [2022-07-20 05:36:03,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061181680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:03,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:03,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:36:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647591370] [2022-07-20 05:36:03,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:03,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:03,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:03,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:03,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:03,197 INFO L87 Difference]: Start difference. First operand 140 states and 229 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:03,323 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2022-07-20 05:36:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:03,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 05:36:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:03,325 INFO L225 Difference]: With dead ends: 211 [2022-07-20 05:36:03,325 INFO L226 Difference]: Without dead ends: 211 [2022-07-20 05:36:03,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-20 05:36:03,326 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 64 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:03,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:36:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-20 05:36:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2022-07-20 05:36:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 316 transitions. [2022-07-20 05:36:03,337 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 316 transitions. Word has length 6 [2022-07-20 05:36:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:03,338 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 316 transitions. [2022-07-20 05:36:03,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 316 transitions. [2022-07-20 05:36:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:36:03,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:03,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:36:03,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:03,547 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-20 05:36:03,548 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2022-07-20 05:36:03,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:03,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110756049] [2022-07-20 05:36:03,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:03,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:03,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:03,551 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-20 05:36:03,552 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-20 05:36:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:03,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:36:03,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:03,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:36:03,612 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-20 05:36:03,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:03,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:03,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110756049] [2022-07-20 05:36:03,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110756049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:03,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:03,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:36:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17073585] [2022-07-20 05:36:03,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:03,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:03,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:03,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:03,615 INFO L87 Difference]: Start difference. First operand 190 states and 316 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:03,729 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2022-07-20 05:36:03,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:03,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 05:36:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:03,731 INFO L225 Difference]: With dead ends: 206 [2022-07-20 05:36:03,731 INFO L226 Difference]: Without dead ends: 206 [2022-07-20 05:36:03,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-20 05:36:03,732 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:03,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:36:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-20 05:36:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2022-07-20 05:36:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 308 transitions. [2022-07-20 05:36:03,740 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 308 transitions. Word has length 6 [2022-07-20 05:36:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:03,740 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 308 transitions. [2022-07-20 05:36:03,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 308 transitions. [2022-07-20 05:36:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:36:03,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:03,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:03,756 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-20 05:36:03,954 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-20 05:36:03,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:03,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2022-07-20 05:36:03,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:03,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047634610] [2022-07-20 05:36:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:03,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:03,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:03,958 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-20 05:36:03,959 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-20 05:36:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:03,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:36:03,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:04,018 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-20 05:36:04,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:04,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:04,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047634610] [2022-07-20 05:36:04,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047634610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:04,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:04,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:36:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034134146] [2022-07-20 05:36:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:04,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:36:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:04,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:36:04,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:36:04,028 INFO L87 Difference]: Start difference. First operand 188 states and 308 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:04,069 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2022-07-20 05:36:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:36:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 05:36:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:04,070 INFO L225 Difference]: With dead ends: 211 [2022-07-20 05:36:04,071 INFO L226 Difference]: Without dead ends: 211 [2022-07-20 05:36:04,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:04,072 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 101 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:04,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 229 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-20 05:36:04,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 144. [2022-07-20 05:36:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2022-07-20 05:36:04,078 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 7 [2022-07-20 05:36:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:04,079 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2022-07-20 05:36:04,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2022-07-20 05:36:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:36:04,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:04,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:04,094 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-20 05:36:04,288 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-20 05:36:04,289 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash 347531241, now seen corresponding path program 1 times [2022-07-20 05:36:04,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:04,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593958061] [2022-07-20 05:36:04,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:04,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:04,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:04,291 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-20 05:36:04,292 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-20 05:36:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:04,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:36:04,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:04,353 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-20 05:36:04,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:04,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:04,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593958061] [2022-07-20 05:36:04,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593958061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:04,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:04,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:36:04,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528123236] [2022-07-20 05:36:04,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:04,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:36:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:04,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:36:04,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:36:04,356 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:04,384 INFO L93 Difference]: Finished difference Result 303 states and 449 transitions. [2022-07-20 05:36:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:36:04,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 05:36:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:04,386 INFO L225 Difference]: With dead ends: 303 [2022-07-20 05:36:04,386 INFO L226 Difference]: Without dead ends: 303 [2022-07-20 05:36:04,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:04,389 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 103 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:04,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 221 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-20 05:36:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 198. [2022-07-20 05:36:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2022-07-20 05:36:04,397 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 8 [2022-07-20 05:36:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:04,397 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2022-07-20 05:36:04,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2022-07-20 05:36:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:36:04,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:04,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:04,411 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-20 05:36:04,609 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-20 05:36:04,610 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash -527615340, now seen corresponding path program 1 times [2022-07-20 05:36:04,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:04,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281444492] [2022-07-20 05:36:04,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:04,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:04,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:04,612 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-20 05:36:04,613 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-20 05:36:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:04,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:36:04,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:04,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:04,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:04,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281444492] [2022-07-20 05:36:04,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281444492] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:04,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:04,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-20 05:36:04,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192676383] [2022-07-20 05:36:04,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:04,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:36:04,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:04,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:36:04,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:36:04,716 INFO L87 Difference]: Start difference. First operand 198 states and 308 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:04,793 INFO L93 Difference]: Finished difference Result 513 states and 746 transitions. [2022-07-20 05:36:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:36:04,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 05:36:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:04,796 INFO L225 Difference]: With dead ends: 513 [2022-07-20 05:36:04,796 INFO L226 Difference]: Without dead ends: 513 [2022-07-20 05:36:04,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:36:04,797 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 262 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:04,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 578 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-20 05:36:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 258. [2022-07-20 05:36:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.6219512195121952) internal successors, (399), 257 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 399 transitions. [2022-07-20 05:36:04,804 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 399 transitions. Word has length 12 [2022-07-20 05:36:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:04,805 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 399 transitions. [2022-07-20 05:36:04,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 399 transitions. [2022-07-20 05:36:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:36:04,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:04,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:04,818 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-20 05:36:05,014 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-20 05:36:05,014 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:05,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:05,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2027186576, now seen corresponding path program 1 times [2022-07-20 05:36:05,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:05,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657961559] [2022-07-20 05:36:05,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:05,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:05,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:05,017 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-20 05:36:05,019 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-20 05:36:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:05,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:36:05,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:05,106 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-20 05:36:05,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:05,143 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-20 05:36:05,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:05,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657961559] [2022-07-20 05:36:05,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657961559] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:05,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:05,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2022-07-20 05:36:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448145900] [2022-07-20 05:36:05,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:36:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:36:05,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:36:05,149 INFO L87 Difference]: Start difference. First operand 258 states and 399 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:05,198 INFO L93 Difference]: Finished difference Result 600 states and 891 transitions. [2022-07-20 05:36:05,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:36:05,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 05:36:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:05,202 INFO L225 Difference]: With dead ends: 600 [2022-07-20 05:36:05,202 INFO L226 Difference]: Without dead ends: 600 [2022-07-20 05:36:05,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:36:05,203 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 244 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:05,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 298 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-07-20 05:36:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 576. [2022-07-20 05:36:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 1.5797872340425532) internal successors, (891), 575 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 891 transitions. [2022-07-20 05:36:05,215 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 891 transitions. Word has length 12 [2022-07-20 05:36:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:05,215 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 891 transitions. [2022-07-20 05:36:05,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 891 transitions. [2022-07-20 05:36:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:36:05,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:05,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:05,239 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-20 05:36:05,432 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-20 05:36:05,433 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:05,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1582579647, now seen corresponding path program 2 times [2022-07-20 05:36:05,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:05,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766588411] [2022-07-20 05:36:05,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:36:05,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:05,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:05,435 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-20 05:36:05,436 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-20 05:36:05,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:36:05,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:36:05,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:36:05,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:05,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:05,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:05,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766588411] [2022-07-20 05:36:05,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766588411] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:05,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:05,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 05:36:05,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490628869] [2022-07-20 05:36:05,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:05,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:36:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:05,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:36:05,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:36:05,549 INFO L87 Difference]: Start difference. First operand 576 states and 891 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-20 05:36:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:05,606 INFO L93 Difference]: Finished difference Result 1062 states and 1609 transitions. [2022-07-20 05:36:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:36:05,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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 16 [2022-07-20 05:36:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:05,610 INFO L225 Difference]: With dead ends: 1062 [2022-07-20 05:36:05,611 INFO L226 Difference]: Without dead ends: 1062 [2022-07-20 05:36:05,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:36:05,611 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 246 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:05,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 442 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-07-20 05:36:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 968. [2022-07-20 05:36:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 956 states have (on average 1.5658995815899581) internal successors, (1497), 967 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1497 transitions. [2022-07-20 05:36:05,628 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1497 transitions. Word has length 16 [2022-07-20 05:36:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:05,629 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1497 transitions. [2022-07-20 05:36:05,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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-20 05:36:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1497 transitions. [2022-07-20 05:36:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:36:05,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:05,630 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:05,641 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-20 05:36:05,839 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-20 05:36:05,839 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash -480845608, now seen corresponding path program 1 times [2022-07-20 05:36:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:05,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122344696] [2022-07-20 05:36:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:05,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:05,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:05,842 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-20 05:36:05,845 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-20 05:36:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:05,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:36:05,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:05,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:05,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122344696] [2022-07-20 05:36:05,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122344696] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:05,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:05,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-20 05:36:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934797506] [2022-07-20 05:36:05,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:05,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:36:05,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:05,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:36:05,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:36:05,982 INFO L87 Difference]: Start difference. First operand 968 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:06,056 INFO L93 Difference]: Finished difference Result 1241 states and 1858 transitions. [2022-07-20 05:36:06,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:36:06,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-07-20 05:36:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:06,061 INFO L225 Difference]: With dead ends: 1241 [2022-07-20 05:36:06,061 INFO L226 Difference]: Without dead ends: 1241 [2022-07-20 05:36:06,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:06,062 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 98 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:06,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 165 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:36:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2022-07-20 05:36:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1100. [2022-07-20 05:36:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1088 states have (on average 1.525735294117647) internal successors, (1660), 1099 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1660 transitions. [2022-07-20 05:36:06,081 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1660 transitions. Word has length 18 [2022-07-20 05:36:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:06,081 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1660 transitions. [2022-07-20 05:36:06,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1660 transitions. [2022-07-20 05:36:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:36:06,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:06,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:06,093 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-20 05:36:06,291 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-20 05:36:06,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1323238580, now seen corresponding path program 1 times [2022-07-20 05:36:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:06,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148113202] [2022-07-20 05:36:06,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:06,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:06,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:06,293 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-20 05:36:06,294 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-20 05:36:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:06,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:36:06,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:06,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:06,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:06,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148113202] [2022-07-20 05:36:06,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148113202] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:06,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:06,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-20 05:36:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825698211] [2022-07-20 05:36:06,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:06,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:36:06,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:36:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:36:06,410 INFO L87 Difference]: Start difference. First operand 1100 states and 1660 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:06,499 INFO L93 Difference]: Finished difference Result 1384 states and 2014 transitions. [2022-07-20 05:36:06,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:36:06,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 05:36:06,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:06,504 INFO L225 Difference]: With dead ends: 1384 [2022-07-20 05:36:06,504 INFO L226 Difference]: Without dead ends: 1384 [2022-07-20 05:36:06,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:36:06,505 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 201 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:06,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 539 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:36:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-07-20 05:36:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1009. [2022-07-20 05:36:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 997 states have (on average 1.4954864593781345) internal successors, (1491), 1008 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1491 transitions. [2022-07-20 05:36:06,527 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1491 transitions. Word has length 21 [2022-07-20 05:36:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:06,527 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1491 transitions. [2022-07-20 05:36:06,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1491 transitions. [2022-07-20 05:36:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:36:06,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:06,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:06,539 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-20 05:36:06,737 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-20 05:36:06,737 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2034622781, now seen corresponding path program 2 times [2022-07-20 05:36:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:06,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425813012] [2022-07-20 05:36:06,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:36:06,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:06,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:06,740 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-20 05:36:06,742 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-20 05:36:06,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:36:06,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:36:06,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:36:06,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:36:06,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:36:06,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:06,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425813012] [2022-07-20 05:36:06,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425813012] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:06,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:06,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 05:36:06,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154921744] [2022-07-20 05:36:06,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:06,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:36:06,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:06,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:36:06,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:36:06,881 INFO L87 Difference]: Start difference. First operand 1009 states and 1491 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 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-20 05:36:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:06,956 INFO L93 Difference]: Finished difference Result 994 states and 1426 transitions. [2022-07-20 05:36:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:36:06,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 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 27 [2022-07-20 05:36:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:06,961 INFO L225 Difference]: With dead ends: 994 [2022-07-20 05:36:06,961 INFO L226 Difference]: Without dead ends: 994 [2022-07-20 05:36:06,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:36:06,962 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 172 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:06,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 522 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2022-07-20 05:36:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 970. [2022-07-20 05:36:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 958 states have (on average 1.488517745302714) internal successors, (1426), 969 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1426 transitions. [2022-07-20 05:36:06,978 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1426 transitions. Word has length 27 [2022-07-20 05:36:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:06,978 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1426 transitions. [2022-07-20 05:36:06,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 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-20 05:36:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1426 transitions. [2022-07-20 05:36:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:36:06,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:06,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:06,994 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-20 05:36:07,188 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-20 05:36:07,188 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:07,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1432941687, now seen corresponding path program 1 times [2022-07-20 05:36:07,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:07,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149647754] [2022-07-20 05:36:07,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:07,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:07,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:07,191 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-20 05:36:07,194 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-20 05:36:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:07,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:36:07,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:07,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:07,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:07,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149647754] [2022-07-20 05:36:07,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149647754] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:07,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:07,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-20 05:36:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973096336] [2022-07-20 05:36:07,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:07,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:36:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:07,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:36:07,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:36:07,340 INFO L87 Difference]: Start difference. First operand 970 states and 1426 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-20 05:36:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:07,443 INFO L93 Difference]: Finished difference Result 1049 states and 1476 transitions. [2022-07-20 05:36:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:36:07,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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 27 [2022-07-20 05:36:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:07,451 INFO L225 Difference]: With dead ends: 1049 [2022-07-20 05:36:07,451 INFO L226 Difference]: Without dead ends: 1049 [2022-07-20 05:36:07,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:36:07,452 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 233 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:07,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 808 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:36:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-07-20 05:36:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 892. [2022-07-20 05:36:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 880 states have (on average 1.4579545454545455) internal successors, (1283), 891 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1283 transitions. [2022-07-20 05:36:07,467 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1283 transitions. Word has length 27 [2022-07-20 05:36:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:07,468 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1283 transitions. [2022-07-20 05:36:07,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-20 05:36:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1283 transitions. [2022-07-20 05:36:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 05:36:07,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:07,469 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:07,481 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-20 05:36:07,678 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-20 05:36:07,678 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:07,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1945741357, now seen corresponding path program 1 times [2022-07-20 05:36:07,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:07,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18724796] [2022-07-20 05:36:07,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:07,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:07,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:07,680 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-20 05:36:07,681 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-20 05:36:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:07,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:36:07,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:07,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:08,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:08,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18724796] [2022-07-20 05:36:08,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18724796] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:08,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:08,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2022-07-20 05:36:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764086039] [2022-07-20 05:36:08,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:08,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:36:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:08,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:36:08,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:36:08,092 INFO L87 Difference]: Start difference. First operand 892 states and 1283 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:08,618 INFO L93 Difference]: Finished difference Result 1882 states and 2645 transitions. [2022-07-20 05:36:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:36:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 05:36:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:08,624 INFO L225 Difference]: With dead ends: 1882 [2022-07-20 05:36:08,625 INFO L226 Difference]: Without dead ends: 1882 [2022-07-20 05:36:08,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2022-07-20 05:36:08,626 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 603 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:08,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1455 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:36:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-07-20 05:36:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1834. [2022-07-20 05:36:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1822 states have (on average 1.451701427003293) internal successors, (2645), 1833 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2645 transitions. [2022-07-20 05:36:08,665 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2645 transitions. Word has length 30 [2022-07-20 05:36:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:08,666 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 2645 transitions. [2022-07-20 05:36:08,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2645 transitions. [2022-07-20 05:36:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:36:08,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:08,668 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:08,691 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-20 05:36:08,892 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-20 05:36:08,892 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:08,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1575281728, now seen corresponding path program 1 times [2022-07-20 05:36:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:08,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82381848] [2022-07-20 05:36:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:08,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:08,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:08,895 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-20 05:36:08,897 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-20 05:36:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:08,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:36:08,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:09,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:09,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:09,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82381848] [2022-07-20 05:36:09,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82381848] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:09,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:09,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-20 05:36:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103400657] [2022-07-20 05:36:09,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:09,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:36:09,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:09,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:36:09,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:36:09,113 INFO L87 Difference]: Start difference. First operand 1834 states and 2645 transitions. Second operand has 8 states, 8 states have (on average 4.125) 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-20 05:36:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:09,243 INFO L93 Difference]: Finished difference Result 2281 states and 3229 transitions. [2022-07-20 05:36:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:36:09,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) 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-20 05:36:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:09,252 INFO L225 Difference]: With dead ends: 2281 [2022-07-20 05:36:09,252 INFO L226 Difference]: Without dead ends: 2281 [2022-07-20 05:36:09,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:36:09,254 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 274 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:09,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1139 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:36:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2022-07-20 05:36:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1782. [2022-07-20 05:36:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1770 states have (on average 1.435593220338983) internal successors, (2541), 1781 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2541 transitions. [2022-07-20 05:36:09,290 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2541 transitions. Word has length 33 [2022-07-20 05:36:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:09,291 INFO L495 AbstractCegarLoop]: Abstraction has 1782 states and 2541 transitions. [2022-07-20 05:36:09,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) 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-20 05:36:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2541 transitions. [2022-07-20 05:36:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 05:36:09,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:09,293 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:09,304 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-20 05:36:09,505 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-20 05:36:09,506 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:09,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:09,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1822753242, now seen corresponding path program 1 times [2022-07-20 05:36:09,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:09,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732095791] [2022-07-20 05:36:09,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:09,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:09,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:09,509 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-20 05:36:09,511 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-20 05:36:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:09,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:36:09,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:09,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:36:09,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:09,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732095791] [2022-07-20 05:36:09,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732095791] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:09,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:09,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-20 05:36:09,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017908711] [2022-07-20 05:36:09,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:09,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:36:09,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:09,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:36:09,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:36:09,752 INFO L87 Difference]: Start difference. First operand 1782 states and 2541 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:09,939 INFO L93 Difference]: Finished difference Result 2267 states and 3177 transitions. [2022-07-20 05:36:09,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:36:09,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-07-20 05:36:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:09,947 INFO L225 Difference]: With dead ends: 2267 [2022-07-20 05:36:09,947 INFO L226 Difference]: Without dead ends: 2267 [2022-07-20 05:36:09,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:36:09,948 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 340 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:09,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1561 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:36:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-07-20 05:36:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1756. [2022-07-20 05:36:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1744 states have (on average 1.427178899082569) internal successors, (2489), 1755 states have internal predecessors, (2489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2489 transitions. [2022-07-20 05:36:09,981 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2489 transitions. Word has length 41 [2022-07-20 05:36:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:09,981 INFO L495 AbstractCegarLoop]: Abstraction has 1756 states and 2489 transitions. [2022-07-20 05:36:09,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2489 transitions. [2022-07-20 05:36:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 05:36:09,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:09,983 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:09,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:10,192 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-20 05:36:10,192 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash 685518324, now seen corresponding path program 2 times [2022-07-20 05:36:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:10,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57405868] [2022-07-20 05:36:10,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:36:10,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:10,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:10,195 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-20 05:36:10,197 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-20 05:36:10,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:36:10,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:36:10,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 05:36:10,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:36:10,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:36:10,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:10,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57405868] [2022-07-20 05:36:10,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57405868] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:10,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:10,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2022-07-20 05:36:10,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199478007] [2022-07-20 05:36:10,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:10,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 05:36:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 05:36:10,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:36:10,711 INFO L87 Difference]: Start difference. First operand 1756 states and 2489 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:11,481 INFO L93 Difference]: Finished difference Result 2042 states and 2804 transitions. [2022-07-20 05:36:11,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 05:36:11,482 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-20 05:36:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:11,489 INFO L225 Difference]: With dead ends: 2042 [2022-07-20 05:36:11,489 INFO L226 Difference]: Without dead ends: 2042 [2022-07-20 05:36:11,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 05:36:11,490 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 738 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:11,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 2048 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:36:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-07-20 05:36:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1982. [2022-07-20 05:36:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1970 states have (on average 1.4233502538071066) internal successors, (2804), 1981 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2804 transitions. [2022-07-20 05:36:11,539 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2804 transitions. Word has length 49 [2022-07-20 05:36:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:11,539 INFO L495 AbstractCegarLoop]: Abstraction has 1982 states and 2804 transitions. [2022-07-20 05:36:11,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2804 transitions. [2022-07-20 05:36:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 05:36:11,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:11,541 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:11,551 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-20 05:36:11,751 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-20 05:36:11,751 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash 34201258, now seen corresponding path program 1 times [2022-07-20 05:36:11,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:11,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000563569] [2022-07-20 05:36:11,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:11,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:11,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:11,754 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-20 05:36:11,756 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-20 05:36:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:11,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 05:36:11,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-20 05:36:11,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-20 05:36:11,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:11,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000563569] [2022-07-20 05:36:11,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000563569] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:11,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:11,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-07-20 05:36:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535299232] [2022-07-20 05:36:11,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:11,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:36:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:11,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:36:11,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:36:11,947 INFO L87 Difference]: Start difference. First operand 1982 states and 2804 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:12,037 INFO L93 Difference]: Finished difference Result 3702 states and 5276 transitions. [2022-07-20 05:36:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:36:12,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-20 05:36:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:12,050 INFO L225 Difference]: With dead ends: 3702 [2022-07-20 05:36:12,050 INFO L226 Difference]: Without dead ends: 3702 [2022-07-20 05:36:12,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:12,051 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 114 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:12,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:36:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2022-07-20 05:36:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3060. [2022-07-20 05:36:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3048 states have (on average 1.4337270341207349) internal successors, (4370), 3059 states have internal predecessors, (4370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4370 transitions. [2022-07-20 05:36:12,106 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4370 transitions. Word has length 50 [2022-07-20 05:36:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:12,107 INFO L495 AbstractCegarLoop]: Abstraction has 3060 states and 4370 transitions. [2022-07-20 05:36:12,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4370 transitions. [2022-07-20 05:36:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 05:36:12,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:12,108 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:12,119 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-20 05:36:12,318 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-20 05:36:12,318 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:12,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1339034765, now seen corresponding path program 1 times [2022-07-20 05:36:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:12,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450997958] [2022-07-20 05:36:12,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:12,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:12,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:12,321 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-20 05:36:12,324 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-20 05:36:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:12,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:36:12,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:12,427 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-20 05:36:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 05:36:12,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 05:36:12,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:12,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450997958] [2022-07-20 05:36:12,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450997958] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:12,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:12,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-07-20 05:36:12,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28683833] [2022-07-20 05:36:12,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:12,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:36:12,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:12,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:36:12,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:12,569 INFO L87 Difference]: Start difference. First operand 3060 states and 4370 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:12,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:12,870 INFO L93 Difference]: Finished difference Result 6279 states and 8905 transitions. [2022-07-20 05:36:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:36:12,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-20 05:36:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:12,893 INFO L225 Difference]: With dead ends: 6279 [2022-07-20 05:36:12,893 INFO L226 Difference]: Without dead ends: 6279 [2022-07-20 05:36:12,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:36:12,894 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 245 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:12,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 219 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:36:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2022-07-20 05:36:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 5707. [2022-07-20 05:36:12,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5707 states, 5696 states have (on average 1.4332865168539326) internal successors, (8164), 5706 states have internal predecessors, (8164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5707 states to 5707 states and 8164 transitions. [2022-07-20 05:36:13,009 INFO L78 Accepts]: Start accepts. Automaton has 5707 states and 8164 transitions. Word has length 53 [2022-07-20 05:36:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:13,009 INFO L495 AbstractCegarLoop]: Abstraction has 5707 states and 8164 transitions. [2022-07-20 05:36:13,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 8164 transitions. [2022-07-20 05:36:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 05:36:13,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:13,010 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:13,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-20 05:36:13,222 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-20 05:36:13,223 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1339034764, now seen corresponding path program 1 times [2022-07-20 05:36:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:13,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593610041] [2022-07-20 05:36:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:13,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:13,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:13,226 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-20 05:36:13,229 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-20 05:36:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:13,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:36:13,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:13,326 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-20 05:36:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 05:36:13,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-20 05:36:13,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:13,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593610041] [2022-07-20 05:36:13,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593610041] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:13,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:13,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-20 05:36:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603855402] [2022-07-20 05:36:13,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:13,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:36:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:36:13,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:36:13,971 INFO L87 Difference]: Start difference. First operand 5707 states and 8164 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 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-20 05:36:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:14,671 INFO L93 Difference]: Finished difference Result 9231 states and 12960 transitions. [2022-07-20 05:36:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:36:14,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 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 53 [2022-07-20 05:36:14,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:14,692 INFO L225 Difference]: With dead ends: 9231 [2022-07-20 05:36:14,693 INFO L226 Difference]: Without dead ends: 9231 [2022-07-20 05:36:14,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:36:14,694 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 289 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:14,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 439 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 05:36:14,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9231 states. [2022-07-20 05:36:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9231 to 8090. [2022-07-20 05:36:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8090 states, 8079 states have (on average 1.4227008293105583) internal successors, (11494), 8089 states have internal predecessors, (11494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8090 states to 8090 states and 11494 transitions. [2022-07-20 05:36:14,857 INFO L78 Accepts]: Start accepts. Automaton has 8090 states and 11494 transitions. Word has length 53 [2022-07-20 05:36:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:14,857 INFO L495 AbstractCegarLoop]: Abstraction has 8090 states and 11494 transitions. [2022-07-20 05:36:14,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 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-20 05:36:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 8090 states and 11494 transitions. [2022-07-20 05:36:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 05:36:14,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:14,860 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:14,872 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-20 05:36:15,069 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-20 05:36:15,070 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:15,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash -137690402, now seen corresponding path program 1 times [2022-07-20 05:36:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:15,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108141505] [2022-07-20 05:36:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:15,072 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-20 05:36:15,072 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-20 05:36:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:15,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:36:15,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 46 proven. 31 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-20 05:36:15,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 46 proven. 31 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-20 05:36:15,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:15,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108141505] [2022-07-20 05:36:15,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108141505] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:15,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:15,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-20 05:36:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248699777] [2022-07-20 05:36:15,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:15,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:36:15,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:15,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:36:15,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:36:15,360 INFO L87 Difference]: Start difference. First operand 8090 states and 11494 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:15,457 INFO L93 Difference]: Finished difference Result 9947 states and 13704 transitions. [2022-07-20 05:36:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:36:15,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 68 [2022-07-20 05:36:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:15,476 INFO L225 Difference]: With dead ends: 9947 [2022-07-20 05:36:15,476 INFO L226 Difference]: Without dead ends: 9947 [2022-07-20 05:36:15,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:36:15,477 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 337 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:15,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 995 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:36:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9947 states. [2022-07-20 05:36:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9947 to 7602. [2022-07-20 05:36:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7602 states, 7591 states have (on average 1.4090370175207483) internal successors, (10696), 7601 states have internal predecessors, (10696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7602 states to 7602 states and 10696 transitions. [2022-07-20 05:36:15,607 INFO L78 Accepts]: Start accepts. Automaton has 7602 states and 10696 transitions. Word has length 68 [2022-07-20 05:36:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:15,607 INFO L495 AbstractCegarLoop]: Abstraction has 7602 states and 10696 transitions. [2022-07-20 05:36:15,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 7602 states and 10696 transitions. [2022-07-20 05:36:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 05:36:15,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:15,609 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 5, 5, 5, 4, 4, 3, 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-20 05:36:15,621 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-20 05:36:15,819 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-20 05:36:15,819 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:15,820 INFO L85 PathProgramCache]: Analyzing trace with hash -231185729, now seen corresponding path program 1 times [2022-07-20 05:36:15,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:15,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188425698] [2022-07-20 05:36:15,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:15,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:15,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:15,822 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-20 05:36:15,824 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-20 05:36:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:15,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:36:15,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-20 05:36:16,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:36:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-20 05:36:16,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:16,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188425698] [2022-07-20 05:36:16,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188425698] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:36:16,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:36:16,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-20 05:36:16,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6057828] [2022-07-20 05:36:16,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:36:16,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:36:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:16,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:36:16,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:36:16,288 INFO L87 Difference]: Start difference. First operand 7602 states and 10696 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:16,547 INFO L93 Difference]: Finished difference Result 11869 states and 16395 transitions. [2022-07-20 05:36:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:36:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 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 71 [2022-07-20 05:36:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:16,568 INFO L225 Difference]: With dead ends: 11869 [2022-07-20 05:36:16,568 INFO L226 Difference]: Without dead ends: 11869 [2022-07-20 05:36:16,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:36:16,569 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 517 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:16,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 853 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:36:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2022-07-20 05:36:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 11460. [2022-07-20 05:36:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11460 states, 11449 states have (on average 1.3871953882435146) internal successors, (15882), 11459 states have internal predecessors, (15882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11460 states to 11460 states and 15882 transitions. [2022-07-20 05:36:16,769 INFO L78 Accepts]: Start accepts. Automaton has 11460 states and 15882 transitions. Word has length 71 [2022-07-20 05:36:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:16,770 INFO L495 AbstractCegarLoop]: Abstraction has 11460 states and 15882 transitions. [2022-07-20 05:36:16,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:36:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 11460 states and 15882 transitions. [2022-07-20 05:36:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 05:36:16,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:16,774 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:16,784 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-20 05:36:16,983 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-20 05:36:16,984 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-20 05:36:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1631832859, now seen corresponding path program 1 times [2022-07-20 05:36:16,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:16,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747230216] [2022-07-20 05:36:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:16,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:16,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:16,986 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-20 05:36:16,988 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-20 05:36:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:36:17,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 05:36:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:36:17,321 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-20 05:36:17,321 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 05:36:17,322 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-07-20 05:36:17,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-07-20 05:36:17,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-07-20 05:36:17,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-07-20 05:36:17,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-07-20 05:36:17,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-07-20 05:36:17,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-07-20 05:36:17,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-07-20 05:36:17,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-07-20 05:36:17,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2022-07-20 05:36:17,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2022-07-20 05:36:17,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2022-07-20 05:36:17,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-07-20 05:36:17,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-07-20 05:36:17,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-07-20 05:36:17,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-07-20 05:36:17,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-07-20 05:36:17,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2022-07-20 05:36:17,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2022-07-20 05:36:17,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2022-07-20 05:36:17,340 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-20 05:36:17,538 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-20 05:36:17,540 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:17,543 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 05:36:17,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:36:17 BoogieIcfgContainer [2022-07-20 05:36:17,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 05:36:17,623 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 05:36:17,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 05:36:17,633 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 05:36:17,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:01" (3/4) ... [2022-07-20 05:36:17,638 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 05:36:17,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 05:36:17,638 INFO L158 Benchmark]: Toolchain (without parser) took 16847.12ms. Allocated memory was 54.5MB in the beginning and 186.6MB in the end (delta: 132.1MB). Free memory was 30.4MB in the beginning and 82.6MB in the end (delta: -52.2MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2022-07-20 05:36:17,641 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:17,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.03ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.1MB in the beginning and 41.8MB in the end (delta: -11.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-07-20 05:36:17,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.74ms. Allocated memory is still 67.1MB. Free memory was 41.8MB in the beginning and 39.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:17,642 INFO L158 Benchmark]: Boogie Preprocessor took 59.29ms. Allocated memory is still 67.1MB. Free memory was 39.7MB in the beginning and 38.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:17,642 INFO L158 Benchmark]: RCFGBuilder took 518.93ms. Allocated memory is still 67.1MB. Free memory was 37.8MB in the beginning and 35.2MB in the end (delta: 2.7MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:17,642 INFO L158 Benchmark]: TraceAbstraction took 15688.73ms. Allocated memory was 67.1MB in the beginning and 186.6MB in the end (delta: 119.5MB). Free memory was 34.7MB in the beginning and 82.6MB in the end (delta: -47.9MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:17,643 INFO L158 Benchmark]: Witness Printer took 14.93ms. Allocated memory is still 186.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:17,644 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 54.5MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.03ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.1MB in the beginning and 41.8MB in the end (delta: -11.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.74ms. Allocated memory is still 67.1MB. Free memory was 41.8MB in the beginning and 39.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.29ms. Allocated memory is still 67.1MB. Free memory was 39.7MB in the beginning and 38.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 518.93ms. Allocated memory is still 67.1MB. Free memory was 37.8MB in the beginning and 35.2MB in the end (delta: 2.7MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15688.73ms. Allocated memory was 67.1MB in the beginning and 186.6MB in the end (delta: 119.5MB). Free memory was 34.7MB in the beginning and 82.6MB in the end (delta: -47.9MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. * Witness Printer took 14.93ms. Allocated memory is still 186.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [garbage={0:0}, pc1=6, pc4=2, pc4++=1, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: VAL [garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L572] COND FALSE !(t4 == ((void *)0)) VAL [garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L576] EXPR t4->next VAL [garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={6:0}, t1={0:0}, t4={6:0}, t4->next={0:0}, x1={6:0}, x4={0:0}] [L576] x4 = t4->next [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: [L578] case 4: VAL [garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L579] COND TRUE S == t4 [L580] S = x4 VAL [garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - 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: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 23, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5369 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5369 mSDsluCounter, 13248 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10179 mSDsCounter, 412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 412 mSolverCounterUnsat, 3069 mSDtfsCounter, 1698 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1255 GetRequests, 1057 SyntacticMatches, 12 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11460occurred in iteration=22, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 7546 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 5578 SizeOfPredicates, 53 NumberOfNonLiveVariables, 2504 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 38 InterpolantComputations, 6 PerfectInterpolantSequences, 1030/1696 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-20 05:36:17,678 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