./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8 --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 13ffae79fd42fd88852ffaba2bbbf2601df90fdda2b5dc6bd9b6228e2cf540c7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:28:00,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:28:00,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:28:01,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:28:01,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:28:01,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:28:01,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:28:01,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:28:01,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:28:01,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:28:01,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:28:01,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:28:01,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:28:01,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:28:01,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:28:01,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:28:01,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:28:01,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:28:01,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:28:01,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:28:01,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:28:01,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:28:01,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:28:01,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:28:01,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:28:01,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:28:01,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:28:01,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:28:01,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:28:01,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:28:01,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:28:01,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:28:01,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:28:01,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:28:01,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:28:01,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:28:01,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:28:01,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:28:01,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:28:01,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:28:01,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:28:01,048 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:28:01,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:28:01,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:28:01,105 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:28:01,106 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:28:01,107 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:28:01,107 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:28:01,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:28:01,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:28:01,109 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:28:01,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:28:01,110 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:28:01,110 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:28:01,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:28:01,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:28:01,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:28:01,111 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:28:01,112 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:28:01,112 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:28:01,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:28:01,112 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:28:01,113 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:28:01,113 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:28:01,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:28:01,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:28:01,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:28:01,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:28:01,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:28:01,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:28:01,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:28:01,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:28:01,122 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8 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 -> 13ffae79fd42fd88852ffaba2bbbf2601df90fdda2b5dc6bd9b6228e2cf540c7 [2022-11-16 11:28:01,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:28:01,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:28:01,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:28:01,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:28:01,432 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:28:01,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2022-11-16 11:28:01,509 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/data/68735c3e4/e3a65c5ac6314f9eab866833d3b9e2e4/FLAG82415388b [2022-11-16 11:28:02,101 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:28:02,105 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2022-11-16 11:28:02,121 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/data/68735c3e4/e3a65c5ac6314f9eab866833d3b9e2e4/FLAG82415388b [2022-11-16 11:28:02,364 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/data/68735c3e4/e3a65c5ac6314f9eab866833d3b9e2e4 [2022-11-16 11:28:02,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:28:02,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:28:02,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:28:02,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:28:02,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:28:02,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:28:02" (1/1) ... [2022-11-16 11:28:02,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@125e4bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:02, skipping insertion in model container [2022-11-16 11:28:02,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:28:02" (1/1) ... [2022-11-16 11:28:02,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:28:02,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:28:02,682 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-16 11:28:02,877 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i[30959,30972] [2022-11-16 11:28:02,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:28:02,899 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:28:02,930 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-16 11:28:02,957 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i[30959,30972] [2022-11-16 11:28:02,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:28:03,001 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:28:03,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03 WrapperNode [2022-11-16 11:28:03,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:28:03,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:28:03,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:28:03,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:28:03,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,066 INFO L138 Inliner]: procedures = 176, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2022-11-16 11:28:03,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:28:03,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:28:03,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:28:03,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:28:03,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,104 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:28:03,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:28:03,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:28:03,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:28:03,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (1/1) ... [2022-11-16 11:28:03,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:28:03,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:28:03,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:28:03,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59aa54af-4825-4734-8e37-34e15fef4161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:28:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-16 11:28:03,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-16 11:28:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:28:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:28:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:28:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:28:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:28:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:28:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:28:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:28:03,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:28:03,214 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:28:03,429 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:28:03,432 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:28:03,652 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:28:03,690 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:28:03,690 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 11:28:03,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:28:03 BoogieIcfgContainer [2022-11-16 11:28:03,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:28:03,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:28:03,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:28:03,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:28:03,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:28:02" (1/3) ... [2022-11-16 11:28:03,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f51f996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:28:03, skipping insertion in model container [2022-11-16 11:28:03,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:28:03" (2/3) ... [2022-11-16 11:28:03,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f51f996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:28:03, skipping insertion in model container [2022-11-16 11:28:03,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:28:03" (3/3) ... [2022-11-16 11:28:03,703 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2022-11-16 11:28:03,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:28:03,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-16 11:28:03,723 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:28:03,779 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:28:03,811 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:28:03,825 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 75 transitions, 155 flow [2022-11-16 11:28:03,828 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 75 transitions, 155 flow [2022-11-16 11:28:03,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 75 transitions, 155 flow [2022-11-16 11:28:03,872 INFO L130 PetriNetUnfolder]: 4/91 cut-off events. [2022-11-16 11:28:03,872 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:28:03,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 4/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2022-11-16 11:28:03,879 INFO L119 LiptonReduction]: Number of co-enabled transitions 1482 [2022-11-16 11:28:06,669 INFO L134 LiptonReduction]: Checked pairs total: 1295 [2022-11-16 11:28:06,669 INFO L136 LiptonReduction]: Total number of compositions: 77 [2022-11-16 11:28:06,686 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 13 transitions, 31 flow [2022-11-16 11:28:06,707 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 36 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:06,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:28:06,748 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71964287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:28:06,749 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:28:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:06,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:06,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:06,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-16 11:28:06,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:06,772 INFO L85 PathProgramCache]: Analyzing trace with hash 12038, now seen corresponding path program 1 times [2022-11-16 11:28:06,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:06,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23575644] [2022-11-16 11:28:06,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:06,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:07,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:07,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23575644] [2022-11-16 11:28:07,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23575644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:07,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:07,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:07,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255480469] [2022-11-16 11:28:07,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:07,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:07,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:07,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:07,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:07,119 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:07,148 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2022-11-16 11:28:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:07,159 INFO L225 Difference]: With dead ends: 24 [2022-11-16 11:28:07,159 INFO L226 Difference]: Without dead ends: 24 [2022-11-16 11:28:07,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:07,165 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:07,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-16 11:28:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-16 11:28:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. [2022-11-16 11:28:07,197 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 2 [2022-11-16 11:28:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:07,197 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 40 transitions. [2022-11-16 11:28:07,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 40 transitions. [2022-11-16 11:28:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:07,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:07,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:07,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:28:07,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-16 11:28:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:07,206 INFO L85 PathProgramCache]: Analyzing trace with hash 12037, now seen corresponding path program 1 times [2022-11-16 11:28:07,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:07,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333215660] [2022-11-16 11:28:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:07,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333215660] [2022-11-16 11:28:07,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333215660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:07,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:07,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:07,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212776999] [2022-11-16 11:28:07,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:07,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:07,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:07,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:07,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:07,381 INFO L87 Difference]: Start difference. First operand 24 states and 40 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:07,399 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2022-11-16 11:28:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:07,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:07,402 INFO L225 Difference]: With dead ends: 19 [2022-11-16 11:28:07,402 INFO L226 Difference]: Without dead ends: 19 [2022-11-16 11:28:07,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:07,404 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:07,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-16 11:28:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-16 11:28:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-11-16 11:28:07,410 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 2 [2022-11-16 11:28:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:07,411 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2022-11-16 11:28:07,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2022-11-16 11:28:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 11:28:07,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:07,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 11:28:07,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:28:07,413 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-16 11:28:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:07,414 INFO L85 PathProgramCache]: Analyzing trace with hash 11575371, now seen corresponding path program 1 times [2022-11-16 11:28:07,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:07,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120642915] [2022-11-16 11:28:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:07,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:07,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:07,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120642915] [2022-11-16 11:28:07,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120642915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:07,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:07,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:07,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544312472] [2022-11-16 11:28:07,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:07,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:07,486 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:07,507 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2022-11-16 11:28:07,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:07,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-16 11:28:07,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:07,509 INFO L225 Difference]: With dead ends: 15 [2022-11-16 11:28:07,509 INFO L226 Difference]: Without dead ends: 15 [2022-11-16 11:28:07,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:07,513 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:07,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-16 11:28:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-16 11:28:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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-11-16 11:28:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2022-11-16 11:28:07,523 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 4 [2022-11-16 11:28:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:07,523 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2022-11-16 11:28:07,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2022-11-16 11:28:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:28:07,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:07,525 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-11-16 11:28:07,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:28:07,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2022-11-16 11:28:07,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:07,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1761013083, now seen corresponding path program 1 times [2022-11-16 11:28:07,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:07,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919703665] [2022-11-16 11:28:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:07,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:07,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:07,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:07,591 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:28:07,593 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-16 11:28:07,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2022-11-16 11:28:07,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2022-11-16 11:28:07,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2022-11-16 11:28:07,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2022-11-16 11:28:07,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2022-11-16 11:28:07,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:28:07,606 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-16 11:28:07,608 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:28:07,608 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 11:28:07,646 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:28:07,652 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:28:07,652 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 115 transitions, 242 flow [2022-11-16 11:28:07,652 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 115 transitions, 242 flow [2022-11-16 11:28:07,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 115 transitions, 242 flow [2022-11-16 11:28:07,690 INFO L130 PetriNetUnfolder]: 7/149 cut-off events. [2022-11-16 11:28:07,691 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 11:28:07,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 149 events. 7/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 306 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2022-11-16 11:28:07,699 INFO L119 LiptonReduction]: Number of co-enabled transitions 6084 [2022-11-16 11:28:10,619 INFO L134 LiptonReduction]: Checked pairs total: 7144 [2022-11-16 11:28:10,619 INFO L136 LiptonReduction]: Total number of compositions: 115 [2022-11-16 11:28:10,620 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 25 transitions, 62 flow [2022-11-16 11:28:10,679 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 358 states, 329 states have (on average 3.282674772036474) internal successors, (1080), 357 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:10,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:28:10,683 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71964287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:28:10,684 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 11:28:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 329 states have (on average 3.282674772036474) internal successors, (1080), 357 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:10,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:10,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:10,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-16 11:28:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:10,691 INFO L85 PathProgramCache]: Analyzing trace with hash 20607, now seen corresponding path program 1 times [2022-11-16 11:28:10,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:10,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170605508] [2022-11-16 11:28:10,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:10,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170605508] [2022-11-16 11:28:10,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170605508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:10,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:10,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:10,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909906589] [2022-11-16 11:28:10,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:10,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:28:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:10,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:28:10,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:28:10,727 INFO L87 Difference]: Start difference. First operand has 358 states, 329 states have (on average 3.282674772036474) internal successors, (1080), 357 states have internal predecessors, (1080), 0 states have call successors, (0), 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, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:10,772 INFO L93 Difference]: Finished difference Result 293 states and 797 transitions. [2022-11-16 11:28:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:28:10,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:10,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:10,779 INFO L225 Difference]: With dead ends: 293 [2022-11-16 11:28:10,779 INFO L226 Difference]: Without dead ends: 293 [2022-11-16 11:28:10,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-11-16 11:28:10,781 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:10,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-16 11:28:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-11-16 11:28:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 275 states have (on average 2.898181818181818) internal successors, (797), 292 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 797 transitions. [2022-11-16 11:28:10,816 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 797 transitions. Word has length 2 [2022-11-16 11:28:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:10,816 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 797 transitions. [2022-11-16 11:28:10,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 797 transitions. [2022-11-16 11:28:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:10,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:10,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:10,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:28:10,818 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-16 11:28:10,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash 20625, now seen corresponding path program 1 times [2022-11-16 11:28:10,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:10,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820169495] [2022-11-16 11:28:10,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:10,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:10,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:10,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820169495] [2022-11-16 11:28:10,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820169495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:10,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:10,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:10,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79883829] [2022-11-16 11:28:10,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:10,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:10,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:10,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:10,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:10,847 INFO L87 Difference]: Start difference. First operand 293 states and 797 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:10,888 INFO L93 Difference]: Finished difference Result 250 states and 676 transitions. [2022-11-16 11:28:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:10,895 INFO L225 Difference]: With dead ends: 250 [2022-11-16 11:28:10,896 INFO L226 Difference]: Without dead ends: 250 [2022-11-16 11:28:10,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:10,897 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:10,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-16 11:28:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-11-16 11:28:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 239 states have (on average 2.8284518828451883) internal successors, (676), 249 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 676 transitions. [2022-11-16 11:28:10,929 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 676 transitions. Word has length 2 [2022-11-16 11:28:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:10,929 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 676 transitions. [2022-11-16 11:28:10,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 676 transitions. [2022-11-16 11:28:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:10,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:10,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:10,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:28:10,931 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-16 11:28:10,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash 20626, now seen corresponding path program 1 times [2022-11-16 11:28:10,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:10,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891013643] [2022-11-16 11:28:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:10,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:10,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:10,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891013643] [2022-11-16 11:28:10,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891013643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:10,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:10,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:10,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22032020] [2022-11-16 11:28:10,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:10,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:10,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:10,999 INFO L87 Difference]: Start difference. First operand 250 states and 676 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:11,028 INFO L93 Difference]: Finished difference Result 207 states and 555 transitions. [2022-11-16 11:28:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:11,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:11,031 INFO L225 Difference]: With dead ends: 207 [2022-11-16 11:28:11,031 INFO L226 Difference]: Without dead ends: 207 [2022-11-16 11:28:11,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:11,032 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:11,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-16 11:28:11,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-11-16 11:28:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 203 states have (on average 2.7339901477832513) internal successors, (555), 206 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 555 transitions. [2022-11-16 11:28:11,056 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 555 transitions. Word has length 2 [2022-11-16 11:28:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:11,075 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 555 transitions. [2022-11-16 11:28:11,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 555 transitions. [2022-11-16 11:28:11,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 11:28:11,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:11,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 11:28:11,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:28:11,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-16 11:28:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash 19835864, now seen corresponding path program 1 times [2022-11-16 11:28:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:11,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460931158] [2022-11-16 11:28:11,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:11,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:11,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460931158] [2022-11-16 11:28:11,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460931158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:11,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:11,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:11,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134199199] [2022-11-16 11:28:11,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:11,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:11,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:11,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:11,150 INFO L87 Difference]: Start difference. First operand 207 states and 555 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:11,205 INFO L93 Difference]: Finished difference Result 168 states and 439 transitions. [2022-11-16 11:28:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:11,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-16 11:28:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:11,213 INFO L225 Difference]: With dead ends: 168 [2022-11-16 11:28:11,214 INFO L226 Difference]: Without dead ends: 168 [2022-11-16 11:28:11,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:11,215 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:11,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-16 11:28:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-11-16 11:28:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 165 states have (on average 2.6606060606060606) internal successors, (439), 167 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 439 transitions. [2022-11-16 11:28:11,237 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 439 transitions. Word has length 4 [2022-11-16 11:28:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:11,238 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 439 transitions. [2022-11-16 11:28:11,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 439 transitions. [2022-11-16 11:28:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:28:11,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:11,239 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-16 11:28:11,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:28:11,240 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-16 11:28:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash 726392231, now seen corresponding path program 1 times [2022-11-16 11:28:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:11,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870363185] [2022-11-16 11:28:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:11,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:11,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:11,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:11,305 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:28:11,306 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-11-16 11:28:11,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2022-11-16 11:28:11,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2022-11-16 11:28:11,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2022-11-16 11:28:11,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2022-11-16 11:28:11,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2022-11-16 11:28:11,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2022-11-16 11:28:11,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:28:11,308 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-16 11:28:11,309 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:28:11,309 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 11:28:11,353 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:28:11,364 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:28:11,364 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 155 transitions, 331 flow [2022-11-16 11:28:11,365 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 155 transitions, 331 flow [2022-11-16 11:28:11,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 155 transitions, 331 flow [2022-11-16 11:28:11,422 INFO L130 PetriNetUnfolder]: 10/207 cut-off events. [2022-11-16 11:28:11,423 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-16 11:28:11,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 207 events. 10/207 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 562 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. [2022-11-16 11:28:11,434 INFO L119 LiptonReduction]: Number of co-enabled transitions 13806 [2022-11-16 11:28:15,270 INFO L134 LiptonReduction]: Checked pairs total: 16337 [2022-11-16 11:28:15,270 INFO L136 LiptonReduction]: Total number of compositions: 154 [2022-11-16 11:28:15,271 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 33 transitions, 87 flow [2022-11-16 11:28:15,384 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2202 states, 2138 states have (on average 4.291861552853134) internal successors, (9176), 2201 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:28:15,386 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71964287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:28:15,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-16 11:28:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 2202 states, 2138 states have (on average 4.291861552853134) internal successors, (9176), 2201 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:15,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:15,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:15,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-16 11:28:15,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:15,394 INFO L85 PathProgramCache]: Analyzing trace with hash 31667, now seen corresponding path program 1 times [2022-11-16 11:28:15,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:15,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905289382] [2022-11-16 11:28:15,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:15,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:15,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:15,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905289382] [2022-11-16 11:28:15,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905289382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:15,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:15,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:15,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075043021] [2022-11-16 11:28:15,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:15,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:28:15,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:15,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:28:15,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:28:15,413 INFO L87 Difference]: Start difference. First operand has 2202 states, 2138 states have (on average 4.291861552853134) internal successors, (9176), 2201 states have internal predecessors, (9176), 0 states have call successors, (0), 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, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:15,472 INFO L93 Difference]: Finished difference Result 1769 states and 6557 transitions. [2022-11-16 11:28:15,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:28:15,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:15,489 INFO L225 Difference]: With dead ends: 1769 [2022-11-16 11:28:15,489 INFO L226 Difference]: Without dead ends: 1769 [2022-11-16 11:28:15,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-11-16 11:28:15,490 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:15,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2022-11-16 11:28:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2022-11-16 11:28:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1731 states have (on average 3.787983824378972) internal successors, (6557), 1768 states have internal predecessors, (6557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 6557 transitions. [2022-11-16 11:28:15,575 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 6557 transitions. Word has length 2 [2022-11-16 11:28:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:15,575 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 6557 transitions. [2022-11-16 11:28:15,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 6557 transitions. [2022-11-16 11:28:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:15,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:15,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:15,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:28:15,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-16 11:28:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:15,577 INFO L85 PathProgramCache]: Analyzing trace with hash 31687, now seen corresponding path program 1 times [2022-11-16 11:28:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:15,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76107229] [2022-11-16 11:28:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:15,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:15,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76107229] [2022-11-16 11:28:15,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76107229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:15,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:15,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:15,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9316385] [2022-11-16 11:28:15,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:15,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:15,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:15,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:15,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:15,609 INFO L87 Difference]: Start difference. First operand 1769 states and 6557 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:15,667 INFO L93 Difference]: Finished difference Result 1510 states and 5572 transitions. [2022-11-16 11:28:15,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:15,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:15,680 INFO L225 Difference]: With dead ends: 1510 [2022-11-16 11:28:15,680 INFO L226 Difference]: Without dead ends: 1510 [2022-11-16 11:28:15,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:15,682 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:15,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:15,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-11-16 11:28:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2022-11-16 11:28:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1487 states have (on average 3.7471418964357768) internal successors, (5572), 1509 states have internal predecessors, (5572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 5572 transitions. [2022-11-16 11:28:15,751 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 5572 transitions. Word has length 2 [2022-11-16 11:28:15,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:15,751 INFO L495 AbstractCegarLoop]: Abstraction has 1510 states and 5572 transitions. [2022-11-16 11:28:15,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 5572 transitions. [2022-11-16 11:28:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:15,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:15,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:15,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:28:15,752 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-16 11:28:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash 31688, now seen corresponding path program 1 times [2022-11-16 11:28:15,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:15,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018380613] [2022-11-16 11:28:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:15,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:15,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018380613] [2022-11-16 11:28:15,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018380613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:15,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:15,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:15,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160822341] [2022-11-16 11:28:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:15,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:15,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:15,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:15,819 INFO L87 Difference]: Start difference. First operand 1510 states and 5572 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:15,904 INFO L93 Difference]: Finished difference Result 1251 states and 4587 transitions. [2022-11-16 11:28:15,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:15,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:15,915 INFO L225 Difference]: With dead ends: 1251 [2022-11-16 11:28:15,915 INFO L226 Difference]: Without dead ends: 1251 [2022-11-16 11:28:15,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:15,917 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:15,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:28:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2022-11-16 11:28:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2022-11-16 11:28:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1243 states have (on average 3.690265486725664) internal successors, (4587), 1250 states have internal predecessors, (4587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 4587 transitions. [2022-11-16 11:28:15,979 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 4587 transitions. Word has length 2 [2022-11-16 11:28:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:15,980 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 4587 transitions. [2022-11-16 11:28:15,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 4587 transitions. [2022-11-16 11:28:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 11:28:15,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:15,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 11:28:15,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:28:15,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-16 11:28:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash 30476370, now seen corresponding path program 1 times [2022-11-16 11:28:15,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:15,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187108395] [2022-11-16 11:28:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:16,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187108395] [2022-11-16 11:28:16,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187108395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:16,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:16,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338978946] [2022-11-16 11:28:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:16,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:16,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:16,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:16,010 INFO L87 Difference]: Start difference. First operand 1251 states and 4587 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:16,073 INFO L93 Difference]: Finished difference Result 1034 states and 3679 transitions. [2022-11-16 11:28:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:16,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-16 11:28:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:16,082 INFO L225 Difference]: With dead ends: 1034 [2022-11-16 11:28:16,083 INFO L226 Difference]: Without dead ends: 1034 [2022-11-16 11:28:16,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:16,084 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:16,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:16,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-11-16 11:28:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2022-11-16 11:28:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1027 states have (on average 3.5822784810126582) internal successors, (3679), 1033 states have internal predecessors, (3679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3679 transitions. [2022-11-16 11:28:16,126 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 3679 transitions. Word has length 4 [2022-11-16 11:28:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:16,126 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 3679 transitions. [2022-11-16 11:28:16,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 3679 transitions. [2022-11-16 11:28:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:28:16,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:16,128 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:16,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:28:16,128 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-16 11:28:16,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:16,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1766256815, now seen corresponding path program 1 times [2022-11-16 11:28:16,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:16,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300927641] [2022-11-16 11:28:16,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:16,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:16,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:16,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300927641] [2022-11-16 11:28:16,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300927641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:16,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:16,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:28:16,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145027383] [2022-11-16 11:28:16,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:16,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:16,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:16,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:16,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:16,194 INFO L87 Difference]: Start difference. First operand 1034 states and 3679 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:16,231 INFO L93 Difference]: Finished difference Result 748 states and 2718 transitions. [2022-11-16 11:28:16,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:16,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:28:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:16,238 INFO L225 Difference]: With dead ends: 748 [2022-11-16 11:28:16,238 INFO L226 Difference]: Without dead ends: 748 [2022-11-16 11:28:16,238 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-11-16 11:28:16,239 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:16,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:16,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-16 11:28:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2022-11-16 11:28:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.63855421686747) internal successors, (2718), 747 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2718 transitions. [2022-11-16 11:28:16,265 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2718 transitions. Word has length 11 [2022-11-16 11:28:16,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:16,265 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 2718 transitions. [2022-11-16 11:28:16,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2718 transitions. [2022-11-16 11:28:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:28:16,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:16,268 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-16 11:28:16,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:28:16,269 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-11-16 11:28:16,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash -223824073, now seen corresponding path program 1 times [2022-11-16 11:28:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:16,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688019024] [2022-11-16 11:28:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:16,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:16,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:16,299 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:28:16,299 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2022-11-16 11:28:16,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2022-11-16 11:28:16,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2022-11-16 11:28:16,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2022-11-16 11:28:16,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2022-11-16 11:28:16,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2022-11-16 11:28:16,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2022-11-16 11:28:16,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2022-11-16 11:28:16,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:28:16,303 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-16 11:28:16,303 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:28:16,303 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-16 11:28:16,333 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:28:16,335 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:28:16,336 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 195 transitions, 422 flow [2022-11-16 11:28:16,336 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 195 transitions, 422 flow [2022-11-16 11:28:16,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 195 transitions, 422 flow [2022-11-16 11:28:16,405 INFO L130 PetriNetUnfolder]: 13/265 cut-off events. [2022-11-16 11:28:16,406 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-16 11:28:16,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 265 events. 13/265 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 829 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 215. Up to 10 conditions per place. [2022-11-16 11:28:16,443 INFO L119 LiptonReduction]: Number of co-enabled transitions 24648 [2022-11-16 11:28:21,084 INFO L134 LiptonReduction]: Checked pairs total: 29340 [2022-11-16 11:28:21,084 INFO L136 LiptonReduction]: Total number of compositions: 196 [2022-11-16 11:28:21,085 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 41 transitions, 114 flow [2022-11-16 11:28:21,754 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13394 states, 13259 states have (on average 5.3871332679689266) internal successors, (71428), 13393 states have internal predecessors, (71428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:21,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:28:21,764 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71964287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:28:21,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-16 11:28:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 13394 states, 13259 states have (on average 5.3871332679689266) internal successors, (71428), 13393 states have internal predecessors, (71428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:21,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:21,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:21,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-16 11:28:21,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash 45504, now seen corresponding path program 1 times [2022-11-16 11:28:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:21,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944188274] [2022-11-16 11:28:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:21,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:21,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:21,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944188274] [2022-11-16 11:28:21,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944188274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:21,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:21,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:21,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237335476] [2022-11-16 11:28:21,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:21,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:21,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:21,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:21,851 INFO L87 Difference]: Start difference. First operand has 13394 states, 13259 states have (on average 5.3871332679689266) internal successors, (71428), 13393 states have internal predecessors, (71428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:22,049 INFO L93 Difference]: Finished difference Result 9070 states and 42508 transitions. [2022-11-16 11:28:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:22,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:22,274 INFO L225 Difference]: With dead ends: 9070 [2022-11-16 11:28:22,291 INFO L226 Difference]: Without dead ends: 9070 [2022-11-16 11:28:22,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:22,299 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:22,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9070 states. [2022-11-16 11:28:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9070 to 9070. [2022-11-16 11:28:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9070 states, 9023 states have (on average 4.71107170564114) internal successors, (42508), 9069 states have internal predecessors, (42508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 42508 transitions. [2022-11-16 11:28:22,794 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 42508 transitions. Word has length 2 [2022-11-16 11:28:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:22,795 INFO L495 AbstractCegarLoop]: Abstraction has 9070 states and 42508 transitions. [2022-11-16 11:28:22,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 42508 transitions. [2022-11-16 11:28:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:22,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:22,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:22,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:28:22,798 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-16 11:28:22,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:22,798 INFO L85 PathProgramCache]: Analyzing trace with hash 45505, now seen corresponding path program 1 times [2022-11-16 11:28:22,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:22,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80612136] [2022-11-16 11:28:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:22,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:22,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80612136] [2022-11-16 11:28:22,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80612136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:22,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:22,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600914243] [2022-11-16 11:28:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:22,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:22,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:22,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:22,984 INFO L87 Difference]: Start difference. First operand 9070 states and 42508 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:23,182 INFO L93 Difference]: Finished difference Result 7515 states and 35043 transitions. [2022-11-16 11:28:23,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:23,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:23,442 INFO L225 Difference]: With dead ends: 7515 [2022-11-16 11:28:23,443 INFO L226 Difference]: Without dead ends: 7515 [2022-11-16 11:28:23,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:23,444 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:23,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:28:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7515 states. [2022-11-16 11:28:23,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7515 to 7515. [2022-11-16 11:28:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7515 states, 7499 states have (on average 4.673023069742633) internal successors, (35043), 7514 states have internal predecessors, (35043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7515 states to 7515 states and 35043 transitions. [2022-11-16 11:28:24,190 INFO L78 Accepts]: Start accepts. Automaton has 7515 states and 35043 transitions. Word has length 2 [2022-11-16 11:28:24,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:24,190 INFO L495 AbstractCegarLoop]: Abstraction has 7515 states and 35043 transitions. [2022-11-16 11:28:24,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 7515 states and 35043 transitions. [2022-11-16 11:28:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 11:28:24,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:24,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 11:28:24,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:28:24,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-16 11:28:24,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash 43766961, now seen corresponding path program 1 times [2022-11-16 11:28:24,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:24,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445252026] [2022-11-16 11:28:24,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:24,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:24,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:24,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445252026] [2022-11-16 11:28:24,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445252026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:24,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:24,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:24,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856556930] [2022-11-16 11:28:24,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:24,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:24,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:24,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:24,236 INFO L87 Difference]: Start difference. First operand 7515 states and 35043 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:24,475 INFO L93 Difference]: Finished difference Result 6460 states and 29327 transitions. [2022-11-16 11:28:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:24,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-16 11:28:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:24,526 INFO L225 Difference]: With dead ends: 6460 [2022-11-16 11:28:24,527 INFO L226 Difference]: Without dead ends: 6460 [2022-11-16 11:28:24,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:24,529 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:24,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:28:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2022-11-16 11:28:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2022-11-16 11:28:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6460 states, 6445 states have (on average 4.550349107835531) internal successors, (29327), 6459 states have internal predecessors, (29327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 29327 transitions. [2022-11-16 11:28:24,882 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 29327 transitions. Word has length 4 [2022-11-16 11:28:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:24,882 INFO L495 AbstractCegarLoop]: Abstraction has 6460 states and 29327 transitions. [2022-11-16 11:28:24,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 29327 transitions. [2022-11-16 11:28:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:28:24,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:24,886 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:24,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:28:24,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-16 11:28:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash 203566247, now seen corresponding path program 1 times [2022-11-16 11:28:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:24,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524306784] [2022-11-16 11:28:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:24,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524306784] [2022-11-16 11:28:24,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524306784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:24,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:24,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:28:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954499465] [2022-11-16 11:28:24,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:24,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:24,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:24,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:24,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:24,943 INFO L87 Difference]: Start difference. First operand 6460 states and 29327 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:25,012 INFO L93 Difference]: Finished difference Result 3748 states and 17343 transitions. [2022-11-16 11:28:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:25,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:28:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:25,037 INFO L225 Difference]: With dead ends: 3748 [2022-11-16 11:28:25,037 INFO L226 Difference]: Without dead ends: 3748 [2022-11-16 11:28:25,037 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-11-16 11:28:25,038 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:25,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2022-11-16 11:28:25,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3748. [2022-11-16 11:28:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3748 states, 3747 states have (on average 4.628502802241793) internal successors, (17343), 3747 states have internal predecessors, (17343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3748 states to 3748 states and 17343 transitions. [2022-11-16 11:28:25,273 INFO L78 Accepts]: Start accepts. Automaton has 3748 states and 17343 transitions. Word has length 11 [2022-11-16 11:28:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:25,274 INFO L495 AbstractCegarLoop]: Abstraction has 3748 states and 17343 transitions. [2022-11-16 11:28:25,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3748 states and 17343 transitions. [2022-11-16 11:28:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:28:25,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:25,280 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:25,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:28:25,280 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-16 11:28:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash -25200554, now seen corresponding path program 1 times [2022-11-16 11:28:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:25,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017410210] [2022-11-16 11:28:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:25,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:25,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:25,330 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:28:25,331 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2022-11-16 11:28:25,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2022-11-16 11:28:25,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2022-11-16 11:28:25,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2022-11-16 11:28:25,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2022-11-16 11:28:25,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2022-11-16 11:28:25,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2022-11-16 11:28:25,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2022-11-16 11:28:25,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2022-11-16 11:28:25,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:28:25,334 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-16 11:28:25,336 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:28:25,336 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-11-16 11:28:25,374 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:28:25,376 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:28:25,377 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 235 transitions, 515 flow [2022-11-16 11:28:25,377 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 235 transitions, 515 flow [2022-11-16 11:28:25,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 235 transitions, 515 flow [2022-11-16 11:28:25,450 INFO L130 PetriNetUnfolder]: 16/323 cut-off events. [2022-11-16 11:28:25,450 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-16 11:28:25,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 323 events. 16/323 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1111 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 278. Up to 12 conditions per place. [2022-11-16 11:28:25,473 INFO L119 LiptonReduction]: Number of co-enabled transitions 38610 [2022-11-16 11:28:30,960 INFO L134 LiptonReduction]: Checked pairs total: 45499 [2022-11-16 11:28:30,960 INFO L136 LiptonReduction]: Total number of compositions: 237 [2022-11-16 11:28:30,961 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 49 transitions, 143 flow [2022-11-16 11:28:34,822 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 81058 states, 80780 states have (on average 6.525427085912354) internal successors, (527124), 81057 states have internal predecessors, (527124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:34,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:28:34,833 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71964287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:28:34,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-16 11:28:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 81058 states, 80780 states have (on average 6.525427085912354) internal successors, (527124), 81057 states have internal predecessors, (527124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:34,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:34,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:34,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:28:34,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash 61896, now seen corresponding path program 1 times [2022-11-16 11:28:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:34,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101893732] [2022-11-16 11:28:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:34,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:35,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101893732] [2022-11-16 11:28:35,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101893732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:35,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:35,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133857275] [2022-11-16 11:28:35,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:35,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:35,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:35,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:35,154 INFO L87 Difference]: Start difference. First operand has 81058 states, 80780 states have (on average 6.525427085912354) internal successors, (527124), 81057 states have internal predecessors, (527124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:36,686 INFO L93 Difference]: Finished difference Result 54430 states and 309484 transitions. [2022-11-16 11:28:36,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:36,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:36,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:37,437 INFO L225 Difference]: With dead ends: 54430 [2022-11-16 11:28:37,437 INFO L226 Difference]: Without dead ends: 54430 [2022-11-16 11:28:37,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:37,438 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:37,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54430 states. [2022-11-16 11:28:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54430 to 54430. [2022-11-16 11:28:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54430 states, 54335 states have (on average 5.695849820557652) internal successors, (309484), 54429 states have internal predecessors, (309484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54430 states to 54430 states and 309484 transitions. [2022-11-16 11:28:41,129 INFO L78 Accepts]: Start accepts. Automaton has 54430 states and 309484 transitions. Word has length 2 [2022-11-16 11:28:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:41,129 INFO L495 AbstractCegarLoop]: Abstraction has 54430 states and 309484 transitions. [2022-11-16 11:28:41,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 54430 states and 309484 transitions. [2022-11-16 11:28:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 11:28:41,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:41,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 11:28:41,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:28:41,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:28:41,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash 61897, now seen corresponding path program 1 times [2022-11-16 11:28:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:41,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360312560] [2022-11-16 11:28:41,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:41,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:41,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360312560] [2022-11-16 11:28:41,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360312560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:41,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:41,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:41,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82566732] [2022-11-16 11:28:41,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:41,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:41,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:41,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:41,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:41,191 INFO L87 Difference]: Start difference. First operand 54430 states and 309484 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:41,818 INFO L93 Difference]: Finished difference Result 45099 states and 255363 transitions. [2022-11-16 11:28:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:41,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-16 11:28:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:42,157 INFO L225 Difference]: With dead ends: 45099 [2022-11-16 11:28:42,157 INFO L226 Difference]: Without dead ends: 45099 [2022-11-16 11:28:42,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:42,158 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:42,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:42,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45099 states. [2022-11-16 11:28:44,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45099 to 45099. [2022-11-16 11:28:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45099 states, 45067 states have (on average 5.666296846916813) internal successors, (255363), 45098 states have internal predecessors, (255363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45099 states to 45099 states and 255363 transitions. [2022-11-16 11:28:44,739 INFO L78 Accepts]: Start accepts. Automaton has 45099 states and 255363 transitions. Word has length 2 [2022-11-16 11:28:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:44,739 INFO L495 AbstractCegarLoop]: Abstraction has 45099 states and 255363 transitions. [2022-11-16 11:28:44,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 45099 states and 255363 transitions. [2022-11-16 11:28:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-16 11:28:44,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:44,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-16 11:28:44,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:28:44,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:28:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:44,741 INFO L85 PathProgramCache]: Analyzing trace with hash 59534721, now seen corresponding path program 1 times [2022-11-16 11:28:44,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:44,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369245248] [2022-11-16 11:28:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:44,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:28:44,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:44,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369245248] [2022-11-16 11:28:44,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369245248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:44,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:44,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:28:44,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010730718] [2022-11-16 11:28:44,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:44,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:44,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:44,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:44,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:44,770 INFO L87 Difference]: Start difference. First operand 45099 states and 255363 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:45,992 INFO L93 Difference]: Finished difference Result 40314 states and 223471 transitions. [2022-11-16 11:28:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:45,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-16 11:28:45,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:46,281 INFO L225 Difference]: With dead ends: 40314 [2022-11-16 11:28:46,281 INFO L226 Difference]: Without dead ends: 40314 [2022-11-16 11:28:46,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:46,282 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:46,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:28:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40314 states. [2022-11-16 11:28:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40314 to 40314. [2022-11-16 11:28:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40314 states, 40283 states have (on average 5.547526251768736) internal successors, (223471), 40313 states have internal predecessors, (223471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40314 states to 40314 states and 223471 transitions. [2022-11-16 11:28:48,256 INFO L78 Accepts]: Start accepts. Automaton has 40314 states and 223471 transitions. Word has length 4 [2022-11-16 11:28:48,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:48,257 INFO L495 AbstractCegarLoop]: Abstraction has 40314 states and 223471 transitions. [2022-11-16 11:28:48,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 40314 states and 223471 transitions. [2022-11-16 11:28:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:28:48,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:48,258 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:48,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:28:48,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:28:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:48,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1554871629, now seen corresponding path program 1 times [2022-11-16 11:28:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:48,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166811635] [2022-11-16 11:28:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:28:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:28:48,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:28:48,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166811635] [2022-11-16 11:28:48,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166811635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:28:48,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:28:48,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:28:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669878310] [2022-11-16 11:28:48,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:28:48,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:28:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:48,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:28:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:28:48,351 INFO L87 Difference]: Start difference. First operand 40314 states and 223471 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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-11-16 11:28:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:28:49,348 INFO L93 Difference]: Finished difference Result 18748 states and 105468 transitions. [2022-11-16 11:28:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:28:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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 11 [2022-11-16 11:28:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:28:49,449 INFO L225 Difference]: With dead ends: 18748 [2022-11-16 11:28:49,449 INFO L226 Difference]: Without dead ends: 18748 [2022-11-16 11:28:49,450 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-11-16 11:28:49,450 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:28:49,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:28:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18748 states. [2022-11-16 11:28:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18748 to 18748. [2022-11-16 11:28:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18748 states, 18747 states have (on average 5.62586013762202) internal successors, (105468), 18747 states have internal predecessors, (105468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:28:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18748 states to 18748 states and 105468 transitions. [2022-11-16 11:28:49,973 INFO L78 Accepts]: Start accepts. Automaton has 18748 states and 105468 transitions. Word has length 11 [2022-11-16 11:28:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:28:49,975 INFO L495 AbstractCegarLoop]: Abstraction has 18748 states and 105468 transitions. [2022-11-16 11:28:49,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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-11-16 11:28:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 18748 states and 105468 transitions. [2022-11-16 11:28:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 11:28:49,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:28:49,983 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:28:49,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:28:49,983 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 11:28:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:28:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash 73879913, now seen corresponding path program 1 times [2022-11-16 11:28:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:28:49,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153306463] [2022-11-16 11:28:49,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:28:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:28:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:49,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:28:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:28:50,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:28:50,013 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:28:50,013 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2022-11-16 11:28:50,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-16 11:28:50,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (7 of 10 remaining) [2022-11-16 11:28:50,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-16 11:28:50,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-16 11:28:50,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 10 remaining) [2022-11-16 11:28:50,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-16 11:28:50,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2022-11-16 11:28:50,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 10 remaining) [2022-11-16 11:28:50,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-16 11:28:50,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 11:28:50,016 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-16 11:28:50,016 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:28:50,016 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2022-11-16 11:28:50,060 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:28:50,063 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:28:50,064 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 275 transitions, 610 flow [2022-11-16 11:28:50,065 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 275 transitions, 610 flow [2022-11-16 11:28:50,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 275 transitions, 610 flow [2022-11-16 11:28:50,143 INFO L130 PetriNetUnfolder]: 19/381 cut-off events. [2022-11-16 11:28:50,143 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-11-16 11:28:50,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 381 events. 19/381 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1371 event pairs, 0 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 342. Up to 14 conditions per place. [2022-11-16 11:28:50,832 INFO L119 LiptonReduction]: Number of co-enabled transitions 55692 [2022-11-16 11:28:56,997 INFO L134 LiptonReduction]: Checked pairs total: 64516 [2022-11-16 11:28:56,998 INFO L136 LiptonReduction]: Total number of compositions: 276 [2022-11-16 11:28:56,999 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 57 transitions, 174 flow