./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/bigshot_s.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/bigshot_s.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R --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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --- 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-38b53e6 [2022-11-25 15:36:15,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:36:15,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:36:15,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:36:15,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:36:15,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:36:15,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:36:15,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:36:15,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:36:15,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:36:15,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:36:15,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:36:15,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:36:15,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:36:15,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:36:15,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:36:15,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:36:15,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:36:15,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:36:15,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:36:15,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:36:15,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:36:15,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:36:15,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:36:15,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:36:15,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:36:15,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:36:15,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:36:15,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:36:15,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:36:15,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:36:15,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:36:15,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:36:15,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:36:15,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:36:15,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:36:15,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:36:15,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:36:15,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:36:15,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:36:15,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:36:15,542 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 15:36:15,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:36:15,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:36:15,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:36:15,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:36:15,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:36:15,596 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:36:15,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:36:15,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:36:15,597 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:36:15,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:36:15,598 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:36:15,598 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:36:15,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:36:15,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:36:15,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:36:15,599 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:36:15,600 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:36:15,600 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:36:15,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:36:15,600 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:36:15,600 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:36:15,601 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:36:15,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:36:15,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:36:15,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:36:15,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:36:15,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:36:15,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:36:15,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:36:15,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:36:15,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:36:15,603 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:36:15,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:36:15,603 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/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_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe [2022-11-25 15:36:15,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:36:15,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:36:15,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:36:15,924 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:36:15,925 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:36:15,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread/bigshot_s.i [2022-11-25 15:36:19,008 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:36:19,321 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:36:19,321 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/sv-benchmarks/c/pthread/bigshot_s.i [2022-11-25 15:36:19,350 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/data/35d3569ea/6aa21c94ed014ef197e1f9d329cf4c08/FLAGefe10f7b2 [2022-11-25 15:36:19,373 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/data/35d3569ea/6aa21c94ed014ef197e1f9d329cf4c08 [2022-11-25 15:36:19,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:36:19,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:36:19,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:36:19,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:36:19,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:36:19,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:36:19" (1/1) ... [2022-11-25 15:36:19,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac15fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:19, skipping insertion in model container [2022-11-25 15:36:19,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:36:19" (1/1) ... [2022-11-25 15:36:19,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:36:19,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:36:20,058 WARN L237 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_f41aeee2-38aa-4168-b1d5-33b53df0cf11/sv-benchmarks/c/pthread/bigshot_s.i[55202,55215] [2022-11-25 15:36:20,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:36:20,087 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:36:20,128 WARN L237 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_f41aeee2-38aa-4168-b1d5-33b53df0cf11/sv-benchmarks/c/pthread/bigshot_s.i[55202,55215] [2022-11-25 15:36:20,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:36:20,206 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:36:20,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20 WrapperNode [2022-11-25 15:36:20,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:36:20,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:36:20,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:36:20,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:36:20,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,258 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-11-25 15:36:20,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:36:20,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:36:20,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:36:20,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:36:20,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,304 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:36:20,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:36:20,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:36:20,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:36:20,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (1/1) ... [2022-11-25 15:36:20,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:36:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:20,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:20,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:36:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:36:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:36:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-25 15:36:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:36:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 15:36:20,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 15:36:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 15:36:20,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 15:36:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:36:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 15:36:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:36:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:36:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:36:20,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:36:20,403 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:36:20,587 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:36:20,590 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:36:20,986 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:36:20,993 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:36:20,993 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:36:20,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:36:20 BoogieIcfgContainer [2022-11-25 15:36:20,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:36:20,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:36:20,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:36:21,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:36:21,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:36:19" (1/3) ... [2022-11-25 15:36:21,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d78c9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:36:21, skipping insertion in model container [2022-11-25 15:36:21,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:20" (2/3) ... [2022-11-25 15:36:21,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d78c9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:36:21, skipping insertion in model container [2022-11-25 15:36:21,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:36:20" (3/3) ... [2022-11-25 15:36:21,012 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2022-11-25 15:36:21,038 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:36:21,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-25 15:36:21,038 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:36:21,137 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 15:36:21,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 119 transitions, 254 flow [2022-11-25 15:36:21,272 INFO L130 PetriNetUnfolder]: 5/117 cut-off events. [2022-11-25 15:36:21,286 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 15:36:21,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 117 events. 5/117 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 151 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-25 15:36:21,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 119 transitions, 254 flow [2022-11-25 15:36:21,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 112 transitions, 236 flow [2022-11-25 15:36:21,333 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:36:21,353 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 112 transitions, 236 flow [2022-11-25 15:36:21,357 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 112 transitions, 236 flow [2022-11-25 15:36:21,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 112 transitions, 236 flow [2022-11-25 15:36:21,406 INFO L130 PetriNetUnfolder]: 5/112 cut-off events. [2022-11-25 15:36:21,407 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 15:36:21,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 112 events. 5/112 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-25 15:36:21,408 INFO L119 LiptonReduction]: Number of co-enabled transitions 360 [2022-11-25 15:36:27,521 INFO L134 LiptonReduction]: Checked pairs total: 485 [2022-11-25 15:36:27,521 INFO L136 LiptonReduction]: Total number of compositions: 131 [2022-11-25 15:36:27,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:36:27,556 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=PETRI_NET, 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;@7381114e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:36:27,556 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-25 15:36:27,558 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 15:36:27,558 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:36:27,558 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:27,559 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:36:27,560 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:27,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:27,564 INFO L85 PathProgramCache]: Analyzing trace with hash 456, now seen corresponding path program 1 times [2022-11-25 15:36:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:27,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625081187] [2022-11-25 15:36:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:27,674 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-25 15:36:27,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:27,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625081187] [2022-11-25 15:36:27,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625081187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:27,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:27,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:36:27,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133842507] [2022-11-25 15:36:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:27,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:36:27,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:27,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:36:27,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:36:27,716 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 250 [2022-11-25 15:36:27,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-25 15:36:27,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:27,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 250 [2022-11-25 15:36:27,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:27,822 INFO L130 PetriNetUnfolder]: 26/69 cut-off events. [2022-11-25 15:36:27,825 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 15:36:27,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 69 events. 26/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 195 event pairs, 18 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 114. Up to 69 conditions per place. [2022-11-25 15:36:27,830 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-11-25 15:36:27,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2022-11-25 15:36:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:36:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:36:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 254 transitions. [2022-11-25 15:36:27,852 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.508 [2022-11-25 15:36:27,853 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 254 transitions. [2022-11-25 15:36:27,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 254 transitions. [2022-11-25 15:36:27,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:27,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 254 transitions. [2022-11-25 15:36:27,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.0) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-25 15:36:27,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 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-25 15:36:27,868 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 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-25 15:36:27,870 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 254 transitions. [2022-11-25 15:36:27,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2022-11-25 15:36:27,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:36:27,876 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2022-11-25 15:36:27,878 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2022-11-25 15:36:27,882 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2022-11-25 15:36:27,882 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2022-11-25 15:36:27,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-25 15:36:27,883 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:27,883 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:36:27,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:36:27,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash 448768, now seen corresponding path program 1 times [2022-11-25 15:36:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:27,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106784776] [2022-11-25 15:36:27,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:27,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:28,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-25 15:36:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:28,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106784776] [2022-11-25 15:36:28,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106784776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:28,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:28,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:36:28,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170633954] [2022-11-25 15:36:28,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:28,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:28,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:28,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:28,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:28,279 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 250 [2022-11-25 15:36:28,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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-25 15:36:28,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:28,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 250 [2022-11-25 15:36:28,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:28,341 INFO L130 PetriNetUnfolder]: 25/66 cut-off events. [2022-11-25 15:36:28,341 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:36:28,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 66 events. 25/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 185 event pairs, 17 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 133. Up to 64 conditions per place. [2022-11-25 15:36:28,343 INFO L137 encePairwiseOnDemand]: 247/250 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2022-11-25 15:36:28,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2022-11-25 15:36:28,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2022-11-25 15:36:28,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2022-11-25 15:36:28,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2022-11-25 15:36:28,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2022-11-25 15:36:28,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:28,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2022-11-25 15:36:28,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-25 15:36:28,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 15:36:28,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 15:36:28,357 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 335 transitions. [2022-11-25 15:36:28,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2022-11-25 15:36:28,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:36:28,358 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2022-11-25 15:36:28,358 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-11-25 15:36:28,359 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-11-25 15:36:28,359 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2022-11-25 15:36:28,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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-25 15:36:28,360 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:28,360 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:36:28,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:36:28,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:28,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash 448769, now seen corresponding path program 1 times [2022-11-25 15:36:28,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:28,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111170145] [2022-11-25 15:36:28,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:28,538 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-25 15:36:28,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:28,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111170145] [2022-11-25 15:36:28,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111170145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:28,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:28,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:36:28,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622370019] [2022-11-25 15:36:28,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:28,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:28,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:28,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:28,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:28,608 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 250 [2022-11-25 15:36:28,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-25 15:36:28,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:28,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 250 [2022-11-25 15:36:28,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:28,669 INFO L130 PetriNetUnfolder]: 24/63 cut-off events. [2022-11-25 15:36:28,669 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:36:28,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 63 events. 24/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 177 event pairs, 16 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 129. Up to 61 conditions per place. [2022-11-25 15:36:28,672 INFO L137 encePairwiseOnDemand]: 247/250 looper letters, 22 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-11-25 15:36:28,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 106 flow [2022-11-25 15:36:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2022-11-25 15:36:28,674 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4613333333333333 [2022-11-25 15:36:28,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2022-11-25 15:36:28,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2022-11-25 15:36:28,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:28,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2022-11-25 15:36:28,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 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-25 15:36:28,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 15:36:28,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 15:36:28,679 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 346 transitions. [2022-11-25 15:36:28,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 106 flow [2022-11-25 15:36:28,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:28,681 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 58 flow [2022-11-25 15:36:28,681 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2022-11-25 15:36:28,682 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2022-11-25 15:36:28,683 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 58 flow [2022-11-25 15:36:28,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-25 15:36:28,683 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:28,683 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:36:28,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:36:28,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:28,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash 485468057, now seen corresponding path program 1 times [2022-11-25 15:36:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:28,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815256462] [2022-11-25 15:36:28,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:28,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:28,831 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-25 15:36:28,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:28,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815256462] [2022-11-25 15:36:28,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815256462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:28,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:28,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:36:28,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597690192] [2022-11-25 15:36:28,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:28,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:28,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:28,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:28,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:28,901 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 250 [2022-11-25 15:36:28,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-25 15:36:28,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:28,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 250 [2022-11-25 15:36:28,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:28,964 INFO L130 PetriNetUnfolder]: 17/49 cut-off events. [2022-11-25 15:36:28,964 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:36:28,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 49 events. 17/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 121 event pairs, 11 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 101. Up to 47 conditions per place. [2022-11-25 15:36:28,965 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 20 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2022-11-25 15:36:28,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 98 flow [2022-11-25 15:36:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2022-11-25 15:36:28,971 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.444 [2022-11-25 15:36:28,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2022-11-25 15:36:28,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2022-11-25 15:36:28,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:28,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2022-11-25 15:36:28,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 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-25 15:36:28,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 15:36:28,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 15:36:28,977 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 58 flow. Second operand 3 states and 333 transitions. [2022-11-25 15:36:28,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 98 flow [2022-11-25 15:36:28,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:28,978 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 54 flow [2022-11-25 15:36:28,978 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2022-11-25 15:36:28,980 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2022-11-25 15:36:28,980 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 54 flow [2022-11-25 15:36:28,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-25 15:36:28,981 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:28,981 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:36:28,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:36:28,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:28,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:28,982 INFO L85 PathProgramCache]: Analyzing trace with hash 485468056, now seen corresponding path program 1 times [2022-11-25 15:36:28,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:28,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669635398] [2022-11-25 15:36:28,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:28,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:29,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:29,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669635398] [2022-11-25 15:36:29,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669635398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:29,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:29,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:36:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879550682] [2022-11-25 15:36:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:29,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:36:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:29,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:36:29,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:36:29,332 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 250 [2022-11-25 15:36:29,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-25 15:36:29,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:29,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 250 [2022-11-25 15:36:29,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:29,380 INFO L130 PetriNetUnfolder]: 10/35 cut-off events. [2022-11-25 15:36:29,380 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:36:29,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 35 events. 10/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 68 event pairs, 6 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 73. Up to 33 conditions per place. [2022-11-25 15:36:29,381 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2022-11-25 15:36:29,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 90 flow [2022-11-25 15:36:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-11-25 15:36:29,388 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-11-25 15:36:29,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2022-11-25 15:36:29,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2022-11-25 15:36:29,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:29,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2022-11-25 15:36:29,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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-25 15:36:29,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 15:36:29,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 15:36:29,393 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 54 flow. Second operand 3 states and 325 transitions. [2022-11-25 15:36:29,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 90 flow [2022-11-25 15:36:29,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:29,395 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2022-11-25 15:36:29,395 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-11-25 15:36:29,397 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2022-11-25 15:36:29,398 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2022-11-25 15:36:29,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-25 15:36:29,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:29,399 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:29,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:36:29,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1424237228, now seen corresponding path program 1 times [2022-11-25 15:36:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:29,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423443574] [2022-11-25 15:36:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:29,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:29,698 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-25 15:36:29,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:29,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423443574] [2022-11-25 15:36:29,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423443574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:29,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:29,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:36:29,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885689600] [2022-11-25 15:36:29,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:29,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:36:29,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:29,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:36:29,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:36:29,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 250 [2022-11-25 15:36:29,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 50 flow. Second operand has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 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-25 15:36:29,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:29,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 250 [2022-11-25 15:36:29,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:30,032 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2022-11-25 15:36:30,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:36:30,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 40 events. 10/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 82 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 85. Up to 21 conditions per place. [2022-11-25 15:36:30,036 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2022-11-25 15:36:30,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 115 flow [2022-11-25 15:36:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:36:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:36:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2022-11-25 15:36:30,039 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.391 [2022-11-25 15:36:30,039 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions. [2022-11-25 15:36:30,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions. [2022-11-25 15:36:30,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:30,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions. [2022-11-25 15:36:30,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 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-25 15:36:30,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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-25 15:36:30,045 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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-25 15:36:30,046 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 50 flow. Second operand 4 states and 391 transitions. [2022-11-25 15:36:30,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 115 flow [2022-11-25 15:36:30,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:30,048 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 54 flow [2022-11-25 15:36:30,049 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-11-25 15:36:30,052 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2022-11-25 15:36:30,052 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2022-11-25 15:36:30,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 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-25 15:36:30,053 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:30,053 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:30,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:36:30,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1424237270, now seen corresponding path program 1 times [2022-11-25 15:36:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:30,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514418823] [2022-11-25 15:36:30,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:30,519 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-25 15:36:30,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:30,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514418823] [2022-11-25 15:36:30,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514418823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:30,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:30,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:36:30,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209076727] [2022-11-25 15:36:30,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:30,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:36:30,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:30,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:36:30,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:36:30,889 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 250 [2022-11-25 15:36:30,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 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-25 15:36:30,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:30,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 250 [2022-11-25 15:36:30,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:31,018 INFO L130 PetriNetUnfolder]: 14/57 cut-off events. [2022-11-25 15:36:31,018 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 15:36:31,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 57 events. 14/57 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 167 event pairs, 7 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 122. Up to 38 conditions per place. [2022-11-25 15:36:31,019 INFO L137 encePairwiseOnDemand]: 245/250 looper letters, 25 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2022-11-25 15:36:31,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 139 flow [2022-11-25 15:36:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:36:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:36:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 613 transitions. [2022-11-25 15:36:31,021 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4086666666666667 [2022-11-25 15:36:31,021 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 613 transitions. [2022-11-25 15:36:31,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 613 transitions. [2022-11-25 15:36:31,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:31,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 613 transitions. [2022-11-25 15:36:31,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 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-25 15:36:31,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 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-25 15:36:31,026 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 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-25 15:36:31,027 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 6 states and 613 transitions. [2022-11-25 15:36:31,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 139 flow [2022-11-25 15:36:31,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:36:31,028 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 75 flow [2022-11-25 15:36:31,028 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=75, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2022-11-25 15:36:31,029 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-11-25 15:36:31,029 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 75 flow [2022-11-25 15:36:31,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 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-25 15:36:31,029 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:31,029 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:31,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:36:31,030 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:31,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:31,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1424237330, now seen corresponding path program 1 times [2022-11-25 15:36:31,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:31,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064024993] [2022-11-25 15:36:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:31,129 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-25 15:36:31,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:31,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064024993] [2022-11-25 15:36:31,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064024993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:31,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:31,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:36:31,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321064475] [2022-11-25 15:36:31,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:31,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:36:31,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:31,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:36:31,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:36:31,206 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 250 [2022-11-25 15:36:31,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 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-25 15:36:31,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:31,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 250 [2022-11-25 15:36:31,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:31,297 INFO L130 PetriNetUnfolder]: 13/51 cut-off events. [2022-11-25 15:36:31,297 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-25 15:36:31,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 51 events. 13/51 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 139 event pairs, 6 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 122. Up to 35 conditions per place. [2022-11-25 15:36:31,298 INFO L137 encePairwiseOnDemand]: 245/250 looper letters, 26 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2022-11-25 15:36:31,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 146 flow [2022-11-25 15:36:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:36:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:36:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 443 transitions. [2022-11-25 15:36:31,301 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.443 [2022-11-25 15:36:31,301 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 443 transitions. [2022-11-25 15:36:31,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 443 transitions. [2022-11-25 15:36:31,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:31,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 443 transitions. [2022-11-25 15:36:31,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 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-25 15:36:31,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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-25 15:36:31,305 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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-25 15:36:31,305 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 75 flow. Second operand 4 states and 443 transitions. [2022-11-25 15:36:31,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 146 flow [2022-11-25 15:36:31,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:36:31,307 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 82 flow [2022-11-25 15:36:31,307 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-11-25 15:36:31,308 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2022-11-25 15:36:31,308 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 82 flow [2022-11-25 15:36:31,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 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-25 15:36:31,309 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:31,309 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:31,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:36:31,309 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:31,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:31,310 INFO L85 PathProgramCache]: Analyzing trace with hash 568336029, now seen corresponding path program 1 times [2022-11-25 15:36:31,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:31,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263723229] [2022-11-25 15:36:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:31,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:31,365 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-25 15:36:31,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:31,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263723229] [2022-11-25 15:36:31,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263723229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:31,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:31,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:36:31,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426534782] [2022-11-25 15:36:31,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:31,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:36:31,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:31,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:36:31,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:36:31,479 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 250 [2022-11-25 15:36:31,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 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-25 15:36:31,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:31,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 250 [2022-11-25 15:36:31,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:31,543 INFO L130 PetriNetUnfolder]: 11/42 cut-off events. [2022-11-25 15:36:31,543 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-11-25 15:36:31,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 42 events. 11/42 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 84 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 114. Up to 24 conditions per place. [2022-11-25 15:36:31,544 INFO L137 encePairwiseOnDemand]: 245/250 looper letters, 19 selfloop transitions, 5 changer transitions 0/24 dead transitions. [2022-11-25 15:36:31,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 135 flow [2022-11-25 15:36:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:36:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:36:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2022-11-25 15:36:31,548 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.437 [2022-11-25 15:36:31,548 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2022-11-25 15:36:31,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2022-11-25 15:36:31,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:31,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2022-11-25 15:36:31,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 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-25 15:36:31,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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-25 15:36:31,553 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 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-25 15:36:31,553 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 82 flow. Second operand 4 states and 437 transitions. [2022-11-25 15:36:31,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 135 flow [2022-11-25 15:36:31,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 24 transitions, 129 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:36:31,555 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 82 flow [2022-11-25 15:36:31,556 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-11-25 15:36:31,557 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-11-25 15:36:31,557 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 82 flow [2022-11-25 15:36:31,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 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-25 15:36:31,559 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:31,560 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:31,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:36:31,562 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:31,562 INFO L85 PathProgramCache]: Analyzing trace with hash 438549302, now seen corresponding path program 1 times [2022-11-25 15:36:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:31,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387525556] [2022-11-25 15:36:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:31,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:32,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:32,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387525556] [2022-11-25 15:36:32,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387525556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:36:32,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982104418] [2022-11-25 15:36:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:32,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:32,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:32,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:36:32,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:36:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:32,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 15:36:32,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:32,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:32,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:32,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:32,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-25 15:36:32,317 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 15:36:32,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-25 15:36:32,413 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 15:36:32,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:36:32,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:36:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:32,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:36:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:32,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982104418] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:36:32,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:36:32,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2022-11-25 15:36:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453260382] [2022-11-25 15:36:32,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:36:32,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 15:36:32,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:32,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 15:36:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:36:34,126 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 250 [2022-11-25 15:36:34,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 82 flow. Second operand has 16 states, 16 states have (on average 90.875) internal successors, (1454), 16 states have internal predecessors, (1454), 0 states have call successors, (0), 0 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-25 15:36:34,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:34,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 250 [2022-11-25 15:36:34,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:35,017 INFO L130 PetriNetUnfolder]: 21/73 cut-off events. [2022-11-25 15:36:35,018 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-11-25 15:36:35,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 73 events. 21/73 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 224 event pairs, 4 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 193. Up to 23 conditions per place. [2022-11-25 15:36:35,019 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 31 selfloop transitions, 13 changer transitions 0/44 dead transitions. [2022-11-25 15:36:35,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 244 flow [2022-11-25 15:36:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:36:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-25 15:36:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1115 transitions. [2022-11-25 15:36:35,023 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37166666666666665 [2022-11-25 15:36:35,023 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1115 transitions. [2022-11-25 15:36:35,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1115 transitions. [2022-11-25 15:36:35,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:35,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1115 transitions. [2022-11-25 15:36:35,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.91666666666667) internal successors, (1115), 12 states have internal predecessors, (1115), 0 states have call successors, (0), 0 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-25 15:36:35,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 250.0) internal successors, (3250), 13 states have internal predecessors, (3250), 0 states have call successors, (0), 0 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-25 15:36:35,033 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 250.0) internal successors, (3250), 13 states have internal predecessors, (3250), 0 states have call successors, (0), 0 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-25 15:36:35,034 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 82 flow. Second operand 12 states and 1115 transitions. [2022-11-25 15:36:35,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 244 flow [2022-11-25 15:36:35,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:36:35,036 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 155 flow [2022-11-25 15:36:35,036 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=155, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-11-25 15:36:35,037 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-11-25 15:36:35,037 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 155 flow [2022-11-25 15:36:35,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 90.875) internal successors, (1454), 16 states have internal predecessors, (1454), 0 states have call successors, (0), 0 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-25 15:36:35,038 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:35,038 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:35,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:35,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 15:36:35,245 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1201685886, now seen corresponding path program 1 times [2022-11-25 15:36:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:35,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040664177] [2022-11-25 15:36:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:35,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:35,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040664177] [2022-11-25 15:36:35,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040664177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:36:35,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47005656] [2022-11-25 15:36:35,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:35,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:35,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:35,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:36:35,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:36:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:35,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 15:36:35,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:35,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:36:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:35,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:36:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:35,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47005656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:36:35,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:36:35,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-11-25 15:36:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454935167] [2022-11-25 15:36:35,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:36:35,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 15:36:35,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:35,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 15:36:35,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:36:36,164 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 250 [2022-11-25 15:36:36,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 155 flow. Second operand has 11 states, 11 states have (on average 102.36363636363636) internal successors, (1126), 11 states have internal predecessors, (1126), 0 states have call successors, (0), 0 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-25 15:36:36,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:36,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 250 [2022-11-25 15:36:36,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:36,356 INFO L130 PetriNetUnfolder]: 17/65 cut-off events. [2022-11-25 15:36:36,357 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-11-25 15:36:36,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 65 events. 17/65 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 166 event pairs, 4 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 215. Up to 24 conditions per place. [2022-11-25 15:36:36,358 INFO L137 encePairwiseOnDemand]: 245/250 looper letters, 35 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2022-11-25 15:36:36,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 275 flow [2022-11-25 15:36:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:36:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:36:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 745 transitions. [2022-11-25 15:36:36,361 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4257142857142857 [2022-11-25 15:36:36,361 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 745 transitions. [2022-11-25 15:36:36,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 745 transitions. [2022-11-25 15:36:36,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:36,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 745 transitions. [2022-11-25 15:36:36,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 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-25 15:36:36,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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-25 15:36:36,367 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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-25 15:36:36,367 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 155 flow. Second operand 7 states and 745 transitions. [2022-11-25 15:36:36,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 275 flow [2022-11-25 15:36:36,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 249 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-11-25 15:36:36,370 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 137 flow [2022-11-25 15:36:36,371 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2022-11-25 15:36:36,371 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-11-25 15:36:36,371 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 137 flow [2022-11-25 15:36:36,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 102.36363636363636) internal successors, (1126), 11 states have internal predecessors, (1126), 0 states have call successors, (0), 0 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-25 15:36:36,372 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:36,372 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:36,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:36,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:36,584 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:36,584 INFO L85 PathProgramCache]: Analyzing trace with hash 709652602, now seen corresponding path program 1 times [2022-11-25 15:36:36,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:36,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796381804] [2022-11-25 15:36:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:36,615 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-25 15:36:36,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:36,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796381804] [2022-11-25 15:36:36,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796381804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:36,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:36,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:36:36,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072426405] [2022-11-25 15:36:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:36,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:36,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:36,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:36,630 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2022-11-25 15:36:36,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 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-25 15:36:36,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:36,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2022-11-25 15:36:36,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:36,670 INFO L130 PetriNetUnfolder]: 16/59 cut-off events. [2022-11-25 15:36:36,670 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-11-25 15:36:36,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 59 events. 16/59 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 11 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 197. Up to 56 conditions per place. [2022-11-25 15:36:36,671 INFO L137 encePairwiseOnDemand]: 248/250 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2022-11-25 15:36:36,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 25 transitions, 180 flow [2022-11-25 15:36:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2022-11-25 15:36:36,673 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46 [2022-11-25 15:36:36,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2022-11-25 15:36:36,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2022-11-25 15:36:36,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:36,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2022-11-25 15:36:36,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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-25 15:36:36,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 15:36:36,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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-25 15:36:36,677 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 137 flow. Second operand 3 states and 345 transitions. [2022-11-25 15:36:36,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 25 transitions, 180 flow [2022-11-25 15:36:36,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 25 transitions, 171 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-25 15:36:36,679 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 121 flow [2022-11-25 15:36:36,680 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-11-25 15:36:36,680 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-11-25 15:36:36,680 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 121 flow [2022-11-25 15:36:36,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 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-25 15:36:36,681 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:36,681 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:36,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:36:36,682 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:36,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:36,682 INFO L85 PathProgramCache]: Analyzing trace with hash 522282167, now seen corresponding path program 1 times [2022-11-25 15:36:36,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:36,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872015761] [2022-11-25 15:36:36,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:36,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:37,036 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-25 15:36:37,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:37,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872015761] [2022-11-25 15:36:37,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872015761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:37,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:37,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:36:37,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404055645] [2022-11-25 15:36:37,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:37,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:36:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:37,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:36:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:36:37,489 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 250 [2022-11-25 15:36:37,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 121 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-25 15:36:37,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:37,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 250 [2022-11-25 15:36:37,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:37,660 INFO L130 PetriNetUnfolder]: 15/53 cut-off events. [2022-11-25 15:36:37,661 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 15:36:37,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 53 events. 15/53 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 112 event pairs, 1 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 174. Up to 38 conditions per place. [2022-11-25 15:36:37,662 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 22 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2022-11-25 15:36:37,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 179 flow [2022-11-25 15:36:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:36:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:36:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-11-25 15:36:37,664 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4064 [2022-11-25 15:36:37,664 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2022-11-25 15:36:37,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2022-11-25 15:36:37,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:37,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2022-11-25 15:36:37,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 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-25 15:36:37,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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-25 15:36:37,669 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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-25 15:36:37,670 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 121 flow. Second operand 5 states and 508 transitions. [2022-11-25 15:36:37,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 179 flow [2022-11-25 15:36:37,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 27 transitions, 176 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 15:36:37,671 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 135 flow [2022-11-25 15:36:37,672 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2022-11-25 15:36:37,672 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-11-25 15:36:37,672 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 135 flow [2022-11-25 15:36:37,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-25 15:36:37,673 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:37,673 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:37,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:36:37,674 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash 348872305, now seen corresponding path program 1 times [2022-11-25 15:36:37,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:37,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776970025] [2022-11-25 15:36:37,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:37,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:38,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:38,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776970025] [2022-11-25 15:36:38,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776970025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:36:38,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863651276] [2022-11-25 15:36:38,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:38,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:38,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:38,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:36:38,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 15:36:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:38,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 15:36:38,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:38,279 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 15:36:38,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-25 15:36:38,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:38,401 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 15:36:38,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-25 15:36:38,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:38,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:38,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:36:38,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-11-25 15:36:38,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2022-11-25 15:36:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:39,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863651276] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:36:39,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:36:39,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2022-11-25 15:36:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137902128] [2022-11-25 15:36:39,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:36:39,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 15:36:39,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:39,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 15:36:39,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-11-25 15:36:41,599 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 250 [2022-11-25 15:36:41,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 135 flow. Second operand has 17 states, 17 states have (on average 86.17647058823529) internal successors, (1465), 17 states have internal predecessors, (1465), 0 states have call successors, (0), 0 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-25 15:36:41,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:41,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 250 [2022-11-25 15:36:41,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:41,991 INFO L130 PetriNetUnfolder]: 14/47 cut-off events. [2022-11-25 15:36:41,991 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-11-25 15:36:41,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 47 events. 14/47 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 2 based on Foata normal form. 2/49 useless extension candidates. Maximal degree in co-relation 174. Up to 29 conditions per place. [2022-11-25 15:36:41,995 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 20 selfloop transitions, 6 changer transitions 0/26 dead transitions. [2022-11-25 15:36:41,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 26 transitions, 188 flow [2022-11-25 15:36:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:36:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:36:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-11-25 15:36:41,997 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3552 [2022-11-25 15:36:41,998 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 444 transitions. [2022-11-25 15:36:41,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 444 transitions. [2022-11-25 15:36:41,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:41,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 444 transitions. [2022-11-25 15:36:42,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 0 states have call successors, (0), 0 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-25 15:36:42,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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-25 15:36:42,002 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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-25 15:36:42,002 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 135 flow. Second operand 5 states and 444 transitions. [2022-11-25 15:36:42,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 26 transitions, 188 flow [2022-11-25 15:36:42,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 26 transitions, 178 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-11-25 15:36:42,005 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 139 flow [2022-11-25 15:36:42,005 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2022-11-25 15:36:42,006 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-11-25 15:36:42,006 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 139 flow [2022-11-25 15:36:42,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 86.17647058823529) internal successors, (1465), 17 states have internal predecessors, (1465), 0 states have call successors, (0), 0 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-25 15:36:42,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:42,007 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:42,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:42,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:42,218 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash 873422294, now seen corresponding path program 2 times [2022-11-25 15:36:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:42,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545385231] [2022-11-25 15:36:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:42,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:42,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545385231] [2022-11-25 15:36:42,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545385231] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:36:42,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227608996] [2022-11-25 15:36:42,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:36:42,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:42,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:42,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:36:42,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 15:36:42,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:36:42,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:36:42,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 15:36:42,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:42,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:42,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:42,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:42,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-25 15:36:43,014 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 15:36:43,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-25 15:36:43,076 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 15:36:43,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:36:43,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:36:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:43,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:36:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:43,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227608996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:36:43,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:36:43,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-11-25 15:36:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450352797] [2022-11-25 15:36:43,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:36:43,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 15:36:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:43,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 15:36:43,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-11-25 15:36:46,490 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 250 [2022-11-25 15:36:46,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 139 flow. Second operand has 25 states, 25 states have (on average 88.56) internal successors, (2214), 25 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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-25 15:36:46,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:46,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 250 [2022-11-25 15:36:46,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:47,599 INFO L130 PetriNetUnfolder]: 25/99 cut-off events. [2022-11-25 15:36:47,600 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-11-25 15:36:47,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 99 events. 25/99 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 317 event pairs, 3 based on Foata normal form. 8/107 useless extension candidates. Maximal degree in co-relation 359. Up to 27 conditions per place. [2022-11-25 15:36:47,601 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 42 selfloop transitions, 19 changer transitions 0/61 dead transitions. [2022-11-25 15:36:47,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 61 transitions, 419 flow [2022-11-25 15:36:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 15:36:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-25 15:36:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1718 transitions. [2022-11-25 15:36:47,607 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3616842105263158 [2022-11-25 15:36:47,608 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1718 transitions. [2022-11-25 15:36:47,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1718 transitions. [2022-11-25 15:36:47,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:47,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1718 transitions. [2022-11-25 15:36:47,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 90.42105263157895) internal successors, (1718), 19 states have internal predecessors, (1718), 0 states have call successors, (0), 0 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-25 15:36:47,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 250.0) internal successors, (5000), 20 states have internal predecessors, (5000), 0 states have call successors, (0), 0 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-25 15:36:47,623 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 250.0) internal successors, (5000), 20 states have internal predecessors, (5000), 0 states have call successors, (0), 0 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-25 15:36:47,623 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 139 flow. Second operand 19 states and 1718 transitions. [2022-11-25 15:36:47,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 61 transitions, 419 flow [2022-11-25 15:36:47,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 408 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-25 15:36:47,627 INFO L231 Difference]: Finished difference. Result has 62 places, 34 transitions, 265 flow [2022-11-25 15:36:47,627 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=265, PETRI_PLACES=62, PETRI_TRANSITIONS=34} [2022-11-25 15:36:47,627 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2022-11-25 15:36:47,628 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 34 transitions, 265 flow [2022-11-25 15:36:47,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 88.56) internal successors, (2214), 25 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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-25 15:36:47,629 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:47,629 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:47,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:47,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 15:36:47,836 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash 873422354, now seen corresponding path program 2 times [2022-11-25 15:36:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:47,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921889517] [2022-11-25 15:36:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:47,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:48,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921889517] [2022-11-25 15:36:48,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921889517] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:36:48,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494698457] [2022-11-25 15:36:48,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:36:48,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:48,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:48,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:36:48,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 15:36:48,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 15:36:48,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:36:48,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 15:36:48,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:48,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:48,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:48,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:48,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-25 15:36:48,261 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 15:36:48,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-25 15:36:48,323 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:36:48,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 15:36:48,354 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 15:36:48,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:36:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 15:36:48,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:36:48,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494698457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:48,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:36:48,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2022-11-25 15:36:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541598789] [2022-11-25 15:36:48,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:48,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:36:48,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:48,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:36:48,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:36:48,785 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 250 [2022-11-25 15:36:48,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 34 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 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-25 15:36:48,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:48,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 250 [2022-11-25 15:36:48,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:48,924 INFO L130 PetriNetUnfolder]: 20/84 cut-off events. [2022-11-25 15:36:48,924 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-11-25 15:36:48,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 84 events. 20/84 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 218 event pairs, 0 based on Foata normal form. 10/94 useless extension candidates. Maximal degree in co-relation 359. Up to 67 conditions per place. [2022-11-25 15:36:48,925 INFO L137 encePairwiseOnDemand]: 245/250 looper letters, 24 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2022-11-25 15:36:48,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 34 transitions, 320 flow [2022-11-25 15:36:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:36:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:36:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2022-11-25 15:36:48,932 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.428 [2022-11-25 15:36:48,933 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2022-11-25 15:36:48,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2022-11-25 15:36:48,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:48,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2022-11-25 15:36:48,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 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-25 15:36:48,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 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-25 15:36:48,940 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 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-25 15:36:48,940 INFO L175 Difference]: Start difference. First operand has 62 places, 34 transitions, 265 flow. Second operand 6 states and 642 transitions. [2022-11-25 15:36:48,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 34 transitions, 320 flow [2022-11-25 15:36:48,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 34 transitions, 298 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-25 15:36:48,944 INFO L231 Difference]: Finished difference. Result has 61 places, 32 transitions, 246 flow [2022-11-25 15:36:48,945 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=61, PETRI_TRANSITIONS=32} [2022-11-25 15:36:48,945 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-11-25 15:36:48,945 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 32 transitions, 246 flow [2022-11-25 15:36:48,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 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-25 15:36:48,946 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:48,946 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:48,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:49,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 15:36:49,152 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash -607433663, now seen corresponding path program 2 times [2022-11-25 15:36:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:49,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464702478] [2022-11-25 15:36:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:49,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:49,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464702478] [2022-11-25 15:36:49,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464702478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:36:49,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962448382] [2022-11-25 15:36:49,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:36:49,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:49,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:49,648 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:36:49,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 15:36:49,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:36:49,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:36:49,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-25 15:36:49,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:49,825 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 15:36:49,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-25 15:36:49,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:49,950 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 15:36:49,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-25 15:36:50,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:50,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:50,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:50,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:50,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:50,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:36:50,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-11-25 15:36:50,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2022-11-25 15:36:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:50,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962448382] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:36:50,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:36:50,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-11-25 15:36:50,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407668690] [2022-11-25 15:36:50,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:36:50,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 15:36:50,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:50,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 15:36:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=315, Unknown=1, NotChecked=0, Total=380 [2022-11-25 15:36:53,190 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 250 [2022-11-25 15:36:53,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 32 transitions, 246 flow. Second operand has 20 states, 20 states have (on average 65.0) internal successors, (1300), 20 states have internal predecessors, (1300), 0 states have call successors, (0), 0 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-25 15:36:53,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:53,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 250 [2022-11-25 15:36:53,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:53,681 INFO L130 PetriNetUnfolder]: 19/78 cut-off events. [2022-11-25 15:36:53,682 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-11-25 15:36:53,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 78 events. 19/78 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 198 event pairs, 2 based on Foata normal form. 2/80 useless extension candidates. Maximal degree in co-relation 322. Up to 57 conditions per place. [2022-11-25 15:36:53,683 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 27 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2022-11-25 15:36:53,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 34 transitions, 307 flow [2022-11-25 15:36:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:36:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:36:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-11-25 15:36:53,685 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.26866666666666666 [2022-11-25 15:36:53,685 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 403 transitions. [2022-11-25 15:36:53,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 403 transitions. [2022-11-25 15:36:53,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:53,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 403 transitions. [2022-11-25 15:36:53,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 0 states have call successors, (0), 0 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-25 15:36:53,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 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-25 15:36:53,690 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 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-25 15:36:53,690 INFO L175 Difference]: Start difference. First operand has 61 places, 32 transitions, 246 flow. Second operand 6 states and 403 transitions. [2022-11-25 15:36:53,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 34 transitions, 307 flow [2022-11-25 15:36:53,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 34 transitions, 279 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-11-25 15:36:53,693 INFO L231 Difference]: Finished difference. Result has 58 places, 30 transitions, 217 flow [2022-11-25 15:36:53,694 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=58, PETRI_TRANSITIONS=30} [2022-11-25 15:36:53,694 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-11-25 15:36:53,694 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 30 transitions, 217 flow [2022-11-25 15:36:53,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 65.0) internal successors, (1300), 20 states have internal predecessors, (1300), 0 states have call successors, (0), 0 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-25 15:36:53,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:53,695 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:53,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:53,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 15:36:53,906 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:53,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:53,906 INFO L85 PathProgramCache]: Analyzing trace with hash -60786105, now seen corresponding path program 1 times [2022-11-25 15:36:53,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:53,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678716330] [2022-11-25 15:36:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:53,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:54,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678716330] [2022-11-25 15:36:54,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678716330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:36:54,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297551940] [2022-11-25 15:36:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:54,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:54,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:54,435 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:36:54,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 15:36:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:54,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 15:36:54,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:54,608 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 15:36:54,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-25 15:36:54,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:54,697 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 15:36:54,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 15:36:54,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:54,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:54,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:54,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:54,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:36:54,951 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_382) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2022-11-25 15:36:55,000 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_382) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2022-11-25 15:36:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-25 15:36:55,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297551940] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:36:55,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:36:55,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-11-25 15:36:55,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402772731] [2022-11-25 15:36:55,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:36:55,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 15:36:55,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:55,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 15:36:55,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=404, Unknown=3, NotChecked=82, Total=552 [2022-11-25 15:36:55,227 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 250 [2022-11-25 15:36:55,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 30 transitions, 217 flow. Second operand has 24 states, 24 states have (on average 50.708333333333336) internal successors, (1217), 24 states have internal predecessors, (1217), 0 states have call successors, (0), 0 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-25 15:36:55,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:55,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 250 [2022-11-25 15:36:55,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:56,131 INFO L130 PetriNetUnfolder]: 19/78 cut-off events. [2022-11-25 15:36:56,131 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-11-25 15:36:56,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 78 events. 19/78 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 184 event pairs, 1 based on Foata normal form. 3/81 useless extension candidates. Maximal degree in co-relation 317. Up to 50 conditions per place. [2022-11-25 15:36:56,132 INFO L137 encePairwiseOnDemand]: 245/250 looper letters, 25 selfloop transitions, 16 changer transitions 0/41 dead transitions. [2022-11-25 15:36:56,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 41 transitions, 348 flow [2022-11-25 15:36:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 15:36:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-25 15:36:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 672 transitions. [2022-11-25 15:36:56,136 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.20676923076923076 [2022-11-25 15:36:56,136 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 672 transitions. [2022-11-25 15:36:56,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 672 transitions. [2022-11-25 15:36:56,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:56,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 672 transitions. [2022-11-25 15:36:56,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 51.69230769230769) internal successors, (672), 13 states have internal predecessors, (672), 0 states have call successors, (0), 0 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-25 15:36:56,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 250.0) internal successors, (3500), 14 states have internal predecessors, (3500), 0 states have call successors, (0), 0 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-25 15:36:56,145 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 250.0) internal successors, (3500), 14 states have internal predecessors, (3500), 0 states have call successors, (0), 0 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-25 15:36:56,145 INFO L175 Difference]: Start difference. First operand has 58 places, 30 transitions, 217 flow. Second operand 13 states and 672 transitions. [2022-11-25 15:36:56,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 41 transitions, 348 flow [2022-11-25 15:36:56,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 41 transitions, 304 flow, removed 2 selfloop flow, removed 9 redundant places. [2022-11-25 15:36:56,148 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 258 flow [2022-11-25 15:36:56,148 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=258, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2022-11-25 15:36:56,149 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2022-11-25 15:36:56,149 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 258 flow [2022-11-25 15:36:56,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 50.708333333333336) internal successors, (1217), 24 states have internal predecessors, (1217), 0 states have call successors, (0), 0 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-25 15:36:56,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:56,150 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:56,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:36:56,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 15:36:56,355 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:36:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:56,356 INFO L85 PathProgramCache]: Analyzing trace with hash -858708787, now seen corresponding path program 3 times [2022-11-25 15:36:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:56,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120280969] [2022-11-25 15:36:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:56,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:57,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120280969] [2022-11-25 15:36:57,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120280969] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:36:57,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952771619] [2022-11-25 15:36:57,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:36:57,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:36:57,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:57,632 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:36:57,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 15:36:57,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 15:36:57,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:36:57,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 15:36:57,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:36:57,856 INFO L321 Elim1Store]: treesize reduction 53, result has 32.9 percent of original size [2022-11-25 15:36:57,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 53 [2022-11-25 15:36:57,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:57,953 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 15:36:57,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 15:36:58,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:58,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:58,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:58,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:58,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:58,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:58,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:58,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:36:58,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:36:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:58,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:36:58,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-11-25 15:36:58,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2022-11-25 15:36:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:36:58,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952771619] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:36:58,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:36:58,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-25 15:36:58,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84177957] [2022-11-25 15:36:58,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:36:58,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 15:36:58,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:58,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 15:36:58,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=617, Unknown=4, NotChecked=0, Total=702 [2022-11-25 15:36:59,529 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 250 [2022-11-25 15:36:59,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 37 transitions, 258 flow. Second operand has 27 states, 27 states have (on average 49.7037037037037) internal successors, (1342), 27 states have internal predecessors, (1342), 0 states have call successors, (0), 0 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-25 15:36:59,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:59,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 250 [2022-11-25 15:36:59,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:00,859 INFO L130 PetriNetUnfolder]: 17/71 cut-off events. [2022-11-25 15:37:00,860 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-11-25 15:37:00,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 71 events. 17/71 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 1 based on Foata normal form. 3/74 useless extension candidates. Maximal degree in co-relation 310. Up to 39 conditions per place. [2022-11-25 15:37:00,861 INFO L137 encePairwiseOnDemand]: 245/250 looper letters, 25 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2022-11-25 15:37:00,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 40 transitions, 346 flow [2022-11-25 15:37:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:37:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:37:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 462 transitions. [2022-11-25 15:37:00,865 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.20533333333333334 [2022-11-25 15:37:00,865 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 462 transitions. [2022-11-25 15:37:00,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 462 transitions. [2022-11-25 15:37:00,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:00,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 462 transitions. [2022-11-25 15:37:00,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 51.333333333333336) internal successors, (462), 9 states have internal predecessors, (462), 0 states have call successors, (0), 0 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-25 15:37:00,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 0 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-25 15:37:00,870 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 0 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-25 15:37:00,870 INFO L175 Difference]: Start difference. First operand has 62 places, 37 transitions, 258 flow. Second operand 9 states and 462 transitions. [2022-11-25 15:37:00,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 40 transitions, 346 flow [2022-11-25 15:37:00,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 40 transitions, 317 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-11-25 15:37:00,873 INFO L231 Difference]: Finished difference. Result has 64 places, 35 transitions, 249 flow [2022-11-25 15:37:00,873 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=249, PETRI_PLACES=64, PETRI_TRANSITIONS=35} [2022-11-25 15:37:00,874 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2022-11-25 15:37:00,874 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 35 transitions, 249 flow [2022-11-25 15:37:00,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 49.7037037037037) internal successors, (1342), 27 states have internal predecessors, (1342), 0 states have call successors, (0), 0 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-25 15:37:00,875 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:00,875 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:00,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:01,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:37:01,086 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:01,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:01,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1651727117, now seen corresponding path program 2 times [2022-11-25 15:37:01,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:37:01,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546298176] [2022-11-25 15:37:01,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:01,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:37:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:01,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:37:01,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546298176] [2022-11-25 15:37:01,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546298176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:37:01,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885154079] [2022-11-25 15:37:01,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:37:01,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:37:01,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:37:01,981 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:37:01,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 15:37:02,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:37:02,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:37:02,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 15:37:02,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:02,193 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 15:37:02,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-25 15:37:02,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:02,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:02,317 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:37:02,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-25 15:37:02,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:02,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:02,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:02,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:02,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:02,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:02,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:37:02,741 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_494 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_494) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2022-11-25 15:37:02,746 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_494 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_494) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2022-11-25 15:37:02,751 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_494 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_494) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2022-11-25 15:37:02,810 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_494 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_494) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset14#1| 5 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2022-11-25 15:37:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-25 15:37:02,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885154079] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:37:02,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:37:02,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-11-25 15:37:02,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981326718] [2022-11-25 15:37:02,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:37:02,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 15:37:02,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:37:02,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 15:37:02,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=592, Unknown=8, NotChecked=204, Total=870 [2022-11-25 15:37:03,021 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 250 [2022-11-25 15:37:03,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 35 transitions, 249 flow. Second operand has 30 states, 30 states have (on average 49.56666666666667) internal successors, (1487), 30 states have internal predecessors, (1487), 0 states have call successors, (0), 0 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-25 15:37:03,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:03,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 250 [2022-11-25 15:37:03,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:04,388 INFO L130 PetriNetUnfolder]: 16/67 cut-off events. [2022-11-25 15:37:04,388 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2022-11-25 15:37:04,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 67 events. 16/67 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 127 event pairs, 1 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 306. Up to 33 conditions per place. [2022-11-25 15:37:04,389 INFO L137 encePairwiseOnDemand]: 245/250 looper letters, 22 selfloop transitions, 18 changer transitions 0/40 dead transitions. [2022-11-25 15:37:04,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 40 transitions, 354 flow [2022-11-25 15:37:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:37:04,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-25 15:37:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 608 transitions. [2022-11-25 15:37:04,392 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.20266666666666666 [2022-11-25 15:37:04,392 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 608 transitions. [2022-11-25 15:37:04,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 608 transitions. [2022-11-25 15:37:04,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:04,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 608 transitions. [2022-11-25 15:37:04,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 50.666666666666664) internal successors, (608), 12 states have internal predecessors, (608), 0 states have call successors, (0), 0 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-25 15:37:04,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 250.0) internal successors, (3250), 13 states have internal predecessors, (3250), 0 states have call successors, (0), 0 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-25 15:37:04,398 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 250.0) internal successors, (3250), 13 states have internal predecessors, (3250), 0 states have call successors, (0), 0 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-25 15:37:04,398 INFO L175 Difference]: Start difference. First operand has 64 places, 35 transitions, 249 flow. Second operand 12 states and 608 transitions. [2022-11-25 15:37:04,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 40 transitions, 354 flow [2022-11-25 15:37:04,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 40 transitions, 318 flow, removed 2 selfloop flow, removed 8 redundant places. [2022-11-25 15:37:04,401 INFO L231 Difference]: Finished difference. Result has 68 places, 37 transitions, 270 flow [2022-11-25 15:37:04,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=270, PETRI_PLACES=68, PETRI_TRANSITIONS=37} [2022-11-25 15:37:04,402 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2022-11-25 15:37:04,402 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 37 transitions, 270 flow [2022-11-25 15:37:04,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 49.56666666666667) internal successors, (1487), 30 states have internal predecessors, (1487), 0 states have call successors, (0), 0 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-25 15:37:04,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:04,403 INFO L209 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:04,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:04,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:37:04,608 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:04,608 INFO L85 PathProgramCache]: Analyzing trace with hash -987424554, now seen corresponding path program 3 times [2022-11-25 15:37:04,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:37:04,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145212076] [2022-11-25 15:37:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:04,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:37:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:05,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:37:05,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145212076] [2022-11-25 15:37:05,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145212076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:37:05,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176552689] [2022-11-25 15:37:05,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:37:05,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:37:05,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:37:05,741 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:37:05,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 15:37:05,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 15:37:05,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:37:05,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-25 15:37:05,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:05,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:05,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:05,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:05,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-25 15:37:05,988 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 15:37:05,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-25 15:37:05,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:06,123 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:37:06,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 15:37:06,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:06,143 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:37:06,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-25 15:37:06,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:06,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:06,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:06,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:06,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:06,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:06,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:06,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:06,817 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-11-25 15:37:06,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 14 [2022-11-25 15:37:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:06,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:37:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:09,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176552689] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:37:09,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:37:09,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 37 [2022-11-25 15:37:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43963692] [2022-11-25 15:37:09,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:37:09,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 15:37:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:37:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 15:37:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1205, Unknown=11, NotChecked=0, Total=1406 [2022-11-25 15:37:15,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:37:16,198 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 250 [2022-11-25 15:37:16,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 37 transitions, 270 flow. Second operand has 38 states, 38 states have (on average 49.3421052631579) internal successors, (1875), 38 states have internal predecessors, (1875), 0 states have call successors, (0), 0 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-25 15:37:16,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:16,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 250 [2022-11-25 15:37:16,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:19,035 INFO L130 PetriNetUnfolder]: 11/53 cut-off events. [2022-11-25 15:37:19,035 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-11-25 15:37:19,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 53 events. 11/53 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 1 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 256. Up to 13 conditions per place. [2022-11-25 15:37:19,036 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 21 selfloop transitions, 18 changer transitions 0/39 dead transitions. [2022-11-25 15:37:19,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 39 transitions, 356 flow [2022-11-25 15:37:19,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 15:37:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-25 15:37:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 657 transitions. [2022-11-25 15:37:19,039 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.20215384615384616 [2022-11-25 15:37:19,039 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 657 transitions. [2022-11-25 15:37:19,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 657 transitions. [2022-11-25 15:37:19,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:19,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 657 transitions. [2022-11-25 15:37:19,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 50.53846153846154) internal successors, (657), 13 states have internal predecessors, (657), 0 states have call successors, (0), 0 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-25 15:37:19,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 250.0) internal successors, (3500), 14 states have internal predecessors, (3500), 0 states have call successors, (0), 0 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-25 15:37:19,045 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 250.0) internal successors, (3500), 14 states have internal predecessors, (3500), 0 states have call successors, (0), 0 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-25 15:37:19,045 INFO L175 Difference]: Start difference. First operand has 68 places, 37 transitions, 270 flow. Second operand 13 states and 657 transitions. [2022-11-25 15:37:19,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 39 transitions, 356 flow [2022-11-25 15:37:19,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 39 transitions, 285 flow, removed 6 selfloop flow, removed 17 redundant places. [2022-11-25 15:37:19,048 INFO L231 Difference]: Finished difference. Result has 60 places, 32 transitions, 190 flow [2022-11-25 15:37:19,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=190, PETRI_PLACES=60, PETRI_TRANSITIONS=32} [2022-11-25 15:37:19,048 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2022-11-25 15:37:19,048 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 32 transitions, 190 flow [2022-11-25 15:37:19,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 49.3421052631579) internal successors, (1875), 38 states have internal predecessors, (1875), 0 states have call successors, (0), 0 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-25 15:37:19,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:19,049 INFO L209 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:19,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:19,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-25 15:37:19,256 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:19,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:19,256 INFO L85 PathProgramCache]: Analyzing trace with hash 335772471, now seen corresponding path program 3 times [2022-11-25 15:37:19,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:37:19,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654251924] [2022-11-25 15:37:19,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:37:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:37:20,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654251924] [2022-11-25 15:37:20,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654251924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:37:20,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762155498] [2022-11-25 15:37:20,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:37:20,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:37:20,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:37:20,215 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:37:20,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 15:37:20,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 15:37:20,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:37:20,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-25 15:37:20,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:20,452 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 15:37:20,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-25 15:37:20,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:20,520 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 15:37:20,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 15:37:20,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:20,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:20,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:20,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:20,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:20,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:20,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 15:37:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:21,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:37:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:21,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762155498] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:37:21,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:37:21,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2022-11-25 15:37:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911057151] [2022-11-25 15:37:21,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:37:21,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 15:37:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:37:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 15:37:21,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1028, Unknown=5, NotChecked=0, Total=1122 [2022-11-25 15:37:25,026 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 250 [2022-11-25 15:37:25,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 32 transitions, 190 flow. Second operand has 34 states, 34 states have (on average 50.529411764705884) internal successors, (1718), 34 states have internal predecessors, (1718), 0 states have call successors, (0), 0 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-25 15:37:25,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:25,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 250 [2022-11-25 15:37:25,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:26,234 INFO L130 PetriNetUnfolder]: 10/47 cut-off events. [2022-11-25 15:37:26,234 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-11-25 15:37:26,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 47 events. 10/47 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 2 based on Foata normal form. 2/49 useless extension candidates. Maximal degree in co-relation 206. Up to 13 conditions per place. [2022-11-25 15:37:26,235 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 18 selfloop transitions, 17 changer transitions 0/35 dead transitions. [2022-11-25 15:37:26,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 35 transitions, 291 flow [2022-11-25 15:37:26,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:37:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 15:37:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 519 transitions. [2022-11-25 15:37:26,238 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2076 [2022-11-25 15:37:26,239 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 519 transitions. [2022-11-25 15:37:26,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 519 transitions. [2022-11-25 15:37:26,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:26,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 519 transitions. [2022-11-25 15:37:26,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 51.9) internal successors, (519), 10 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-25 15:37:26,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 250.0) internal successors, (2750), 11 states have internal predecessors, (2750), 0 states have call successors, (0), 0 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-25 15:37:26,243 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 250.0) internal successors, (2750), 11 states have internal predecessors, (2750), 0 states have call successors, (0), 0 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-25 15:37:26,243 INFO L175 Difference]: Start difference. First operand has 60 places, 32 transitions, 190 flow. Second operand 10 states and 519 transitions. [2022-11-25 15:37:26,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 35 transitions, 291 flow [2022-11-25 15:37:26,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 35 transitions, 252 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-11-25 15:37:26,245 INFO L231 Difference]: Finished difference. Result has 56 places, 31 transitions, 176 flow [2022-11-25 15:37:26,246 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=176, PETRI_PLACES=56, PETRI_TRANSITIONS=31} [2022-11-25 15:37:26,246 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-11-25 15:37:26,246 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 31 transitions, 176 flow [2022-11-25 15:37:26,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 50.529411764705884) internal successors, (1718), 34 states have internal predecessors, (1718), 0 states have call successors, (0), 0 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-25 15:37:26,247 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:26,247 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:26,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:26,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:37:26,453 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:26,453 INFO L85 PathProgramCache]: Analyzing trace with hash -943239343, now seen corresponding path program 4 times [2022-11-25 15:37:26,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:37:26,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987797621] [2022-11-25 15:37:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:37:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:37:26,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:37:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:37:26,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:37:26,622 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:37:26,624 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2022-11-25 15:37:26,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2022-11-25 15:37:26,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2022-11-25 15:37:26,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2022-11-25 15:37:26,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2022-11-25 15:37:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2022-11-25 15:37:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2022-11-25 15:37:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2022-11-25 15:37:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2022-11-25 15:37:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2022-11-25 15:37:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2022-11-25 15:37:26,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2022-11-25 15:37:26,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2022-11-25 15:37:26,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2022-11-25 15:37:26,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2022-11-25 15:37:26,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2022-11-25 15:37:26,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2022-11-25 15:37:26,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2022-11-25 15:37:26,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2022-11-25 15:37:26,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2022-11-25 15:37:26,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2022-11-25 15:37:26,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2022-11-25 15:37:26,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2022-11-25 15:37:26,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2022-11-25 15:37:26,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2022-11-25 15:37:26,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2022-11-25 15:37:26,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 15:37:26,634 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:26,640 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:37:26,640 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:37:26,667 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,668 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,668 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,668 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,671 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,671 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,671 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,671 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,672 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,672 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,672 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,673 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,676 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,676 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,676 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,677 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,677 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,677 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,677 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,678 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,679 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,679 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,679 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,680 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,684 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,685 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,685 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,687 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,688 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,688 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,688 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,688 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,690 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,690 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,690 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,690 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:37:26,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:37:26,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:37:26,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:37:26,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:37:26,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:37:26,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:37:26,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:37:26,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:37:26 BasicIcfg [2022-11-25 15:37:26,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:37:26,730 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:37:26,730 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:37:26,730 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:37:26,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:36:20" (3/4) ... [2022-11-25 15:37:26,733 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:37:26,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:37:26,734 INFO L158 Benchmark]: Toolchain (without parser) took 67356.68ms. Allocated memory was 134.2MB in the beginning and 325.1MB in the end (delta: 190.8MB). Free memory was 69.5MB in the beginning and 173.8MB in the end (delta: -104.4MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2022-11-25 15:37:26,734 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:37:26,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 825.73ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 69.3MB in the beginning and 126.8MB in the end (delta: -57.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-11-25 15:37:26,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.69ms. Allocated memory is still 186.6MB. Free memory was 126.8MB in the beginning and 123.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:37:26,735 INFO L158 Benchmark]: Boogie Preprocessor took 48.80ms. Allocated memory is still 186.6MB. Free memory was 123.9MB in the beginning and 122.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:37:26,735 INFO L158 Benchmark]: RCFGBuilder took 686.77ms. Allocated memory is still 186.6MB. Free memory was 122.6MB in the beginning and 105.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 15:37:26,736 INFO L158 Benchmark]: TraceAbstraction took 65731.85ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 105.0MB in the beginning and 174.9MB in the end (delta: -69.9MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2022-11-25 15:37:26,736 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 325.1MB. Free memory was 174.9MB in the beginning and 173.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:37:26,743 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 825.73ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 69.3MB in the beginning and 126.8MB in the end (delta: -57.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.69ms. Allocated memory is still 186.6MB. Free memory was 126.8MB in the beginning and 123.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.80ms. Allocated memory is still 186.6MB. Free memory was 123.9MB in the beginning and 122.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 686.77ms. Allocated memory is still 186.6MB. Free memory was 122.6MB in the beginning and 105.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 65731.85ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 105.0MB in the beginning and 174.9MB in the end (delta: -69.9MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 325.1MB. Free memory was 174.9MB in the beginning and 173.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 114 PlacesBefore, 36 PlacesAfterwards, 112 TransitionsBefore, 31 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 6 FixpointIterations, 70 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 131 TotalNumberOfCompositions, 485 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 394, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 241, independent: 229, independent conditional: 0, independent unconditional: 229, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 241, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 394, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 241, unknown conditional: 0, unknown unconditional: 241] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1107. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, pthread_create(&t1, 0, thread1, 0)=13, t1={10:0}, t2={9:0}, v={0:0}] [L1123] 0 \read(t1) VAL [\read(t1)=13, arg={0:0}, t1={10:0}, t2={9:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=13, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={9:0}, v={-2:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=14, t1={10:0}, t2={9:0}, v={-2:0}] [L1116] COND TRUE 2 \read(*v) [L1116] CALL 2 strcpy(v, "Bigshot") [L1125] 0 \read(t2) VAL [\read(t2)=14, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={9:0}, v={-2:0}] [L1116] RET 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=14, \result={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={9:0}, v={-2:0}] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] EXPR 0 v[0] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] CALL 0 __VERIFIER_assert(!v || v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(!v || v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 152 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 65.5s, OverallIterations: 23, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 34.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 211 mSolverCounterUnknown, 6709 SdHoareTripleChecker+Valid, 25.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5662 mSDsluCounter, 9716 SdHoareTripleChecker+Invalid, 23.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 268 IncrementalHoareTripleChecker+Unchecked, 9421 mSDsCounter, 588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26554 IncrementalHoareTripleChecker+Invalid, 27621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 588 mSolverCounterUnsat, 295 mSDtfsCounter, 26554 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 352 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=20, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 409 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 490 ConstructedInterpolants, 123 QuantifiedInterpolants, 10053 SizeOfPredicates, 85 NumberOfNonLiveVariables, 2576 ConjunctsInSsa, 410 ConjunctsInUnsatCore, 43 InterpolantComputations, 12 PerfectInterpolantSequences, 18/332 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 15:37:26,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/bigshot_s.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R --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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --- 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-38b53e6 [2022-11-25 15:37:29,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:37:29,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:37:29,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:37:29,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:37:29,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:37:29,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:37:29,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:37:29,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:37:29,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:37:29,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:37:29,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:37:29,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:37:29,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:37:29,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:37:29,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:37:29,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:37:29,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:37:29,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:37:29,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:37:29,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:37:29,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:37:29,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:37:29,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:37:29,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:37:29,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:37:29,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:37:29,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:37:29,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:37:29,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:37:29,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:37:29,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:37:29,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:37:29,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:37:29,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:37:29,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:37:29,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:37:29,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:37:29,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:37:29,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:37:29,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:37:29,244 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 15:37:29,290 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:37:29,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:37:29,293 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:37:29,293 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:37:29,294 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:37:29,294 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:37:29,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:37:29,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:37:29,296 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:37:29,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:37:29,297 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:37:29,297 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:37:29,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:37:29,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:37:29,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:37:29,298 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:37:29,298 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:37:29,298 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:37:29,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:37:29,299 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:37:29,299 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 15:37:29,299 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 15:37:29,300 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:37:29,300 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:37:29,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:37:29,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:37:29,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:37:29,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:37:29,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:37:29,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:37:29,301 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 15:37:29,302 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 15:37:29,302 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:37:29,302 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:37:29,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:37:29,303 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 15:37:29,303 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/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_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe [2022-11-25 15:37:29,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:37:29,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:37:29,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:37:29,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:37:29,685 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:37:29,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread/bigshot_s.i [2022-11-25 15:37:32,792 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:37:33,173 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:37:33,174 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/sv-benchmarks/c/pthread/bigshot_s.i [2022-11-25 15:37:33,194 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/data/016d063d8/33a31d0c820e4f699369e7c337d74dc3/FLAG8165bfc62 [2022-11-25 15:37:33,213 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/data/016d063d8/33a31d0c820e4f699369e7c337d74dc3 [2022-11-25 15:37:33,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:37:33,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:37:33,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:37:33,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:37:33,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:37:33,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:37:33" (1/1) ... [2022-11-25 15:37:33,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754b00b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:33, skipping insertion in model container [2022-11-25 15:37:33,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:37:33" (1/1) ... [2022-11-25 15:37:33,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:37:33,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:37:34,086 WARN L237 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_f41aeee2-38aa-4168-b1d5-33b53df0cf11/sv-benchmarks/c/pthread/bigshot_s.i[55202,55215] [2022-11-25 15:37:34,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:37:34,140 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:37:34,195 WARN L237 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_f41aeee2-38aa-4168-b1d5-33b53df0cf11/sv-benchmarks/c/pthread/bigshot_s.i[55202,55215] [2022-11-25 15:37:34,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:37:34,389 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:37:34,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34 WrapperNode [2022-11-25 15:37:34,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:37:34,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:37:34,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:37:34,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:37:34,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,472 INFO L138 Inliner]: procedures = 327, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2022-11-25 15:37:34,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:37:34,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:37:34,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:37:34,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:37:34,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,537 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:37:34,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:37:34,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:37:34,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:37:34,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (1/1) ... [2022-11-25 15:37:34,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:37:34,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:37:34,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:37:34,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:37:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 15:37:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 15:37:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:37:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:37:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 15:37:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 15:37:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 15:37:34,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 15:37:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 15:37:34,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 15:37:34,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-11-25 15:37:34,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 15:37:34,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:37:34,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:37:34,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:37:34,643 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:37:34,841 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:37:34,844 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:37:35,291 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:37:35,310 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:37:35,310 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:37:35,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:35 BoogieIcfgContainer [2022-11-25 15:37:35,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:37:35,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:37:35,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:37:35,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:37:35,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:37:33" (1/3) ... [2022-11-25 15:37:35,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f28b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:37:35, skipping insertion in model container [2022-11-25 15:37:35,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:34" (2/3) ... [2022-11-25 15:37:35,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f28b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:37:35, skipping insertion in model container [2022-11-25 15:37:35,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:35" (3/3) ... [2022-11-25 15:37:35,331 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2022-11-25 15:37:35,351 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:37:35,352 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-25 15:37:35,352 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:37:35,522 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 15:37:35,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 120 transitions, 256 flow [2022-11-25 15:37:35,644 INFO L130 PetriNetUnfolder]: 5/118 cut-off events. [2022-11-25 15:37:35,645 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 15:37:35,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 118 events. 5/118 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-11-25 15:37:35,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 120 transitions, 256 flow [2022-11-25 15:37:35,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 113 transitions, 238 flow [2022-11-25 15:37:35,658 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:37:35,674 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 113 transitions, 238 flow [2022-11-25 15:37:35,677 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 113 transitions, 238 flow [2022-11-25 15:37:35,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 113 transitions, 238 flow [2022-11-25 15:37:35,717 INFO L130 PetriNetUnfolder]: 5/113 cut-off events. [2022-11-25 15:37:35,720 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 15:37:35,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 113 events. 5/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 151 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-25 15:37:35,724 INFO L119 LiptonReduction]: Number of co-enabled transitions 360 [2022-11-25 15:37:52,744 INFO L134 LiptonReduction]: Checked pairs total: 478 [2022-11-25 15:37:52,745 INFO L136 LiptonReduction]: Total number of compositions: 126 [2022-11-25 15:37:52,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:37:52,768 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=PETRI_NET, 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;@1a594f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:37:52,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-25 15:37:52,771 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 15:37:52,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:37:52,771 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:52,772 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:37:52,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:52,778 INFO L85 PathProgramCache]: Analyzing trace with hash 457, now seen corresponding path program 1 times [2022-11-25 15:37:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:52,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836886349] [2022-11-25 15:37:52,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:52,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:52,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:52,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:37:52,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 15:37:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:52,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 15:37:52,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:52,908 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-25 15:37:52,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:52,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:52,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836886349] [2022-11-25 15:37:52,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836886349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:52,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:52,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:37:52,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675608974] [2022-11-25 15:37:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:52,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:37:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:52,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:37:52,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:37:52,958 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2022-11-25 15:37:52,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-25 15:37:52,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:52,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2022-11-25 15:37:52,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:53,129 INFO L130 PetriNetUnfolder]: 26/69 cut-off events. [2022-11-25 15:37:53,130 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 15:37:53,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 69 events. 26/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 181 event pairs, 18 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 114. Up to 69 conditions per place. [2022-11-25 15:37:53,132 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-11-25 15:37:53,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2022-11-25 15:37:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:37:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:37:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 256 transitions. [2022-11-25 15:37:53,147 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326 [2022-11-25 15:37:53,147 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 256 transitions. [2022-11-25 15:37:53,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 256 transitions. [2022-11-25 15:37:53,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:53,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 256 transitions. [2022-11-25 15:37:53,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 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-25 15:37:53,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-25 15:37:53,163 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-25 15:37:53,165 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 256 transitions. [2022-11-25 15:37:53,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2022-11-25 15:37:53,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:37:53,170 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2022-11-25 15:37:53,172 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2022-11-25 15:37:53,175 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2022-11-25 15:37:53,176 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2022-11-25 15:37:53,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 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-25 15:37:53,176 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:53,177 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:37:53,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:53,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:53,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:53,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash 447807, now seen corresponding path program 1 times [2022-11-25 15:37:53,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:53,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352967876] [2022-11-25 15:37:53,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:53,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:53,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:53,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:37:53,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 15:37:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:53,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:37:53,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:53,562 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 15:37:53,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 15:37:53,590 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-25 15:37:53,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:53,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:53,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352967876] [2022-11-25 15:37:53,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352967876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:53,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:53,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:37:53,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227878191] [2022-11-25 15:37:53,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:53,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:37:53,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:37:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:37:53,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2022-11-25 15:37:53,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-25 15:37:53,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:53,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2022-11-25 15:37:53,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:53,813 INFO L130 PetriNetUnfolder]: 25/66 cut-off events. [2022-11-25 15:37:53,813 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:37:53,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 66 events. 25/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 171 event pairs, 17 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 133. Up to 64 conditions per place. [2022-11-25 15:37:53,814 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2022-11-25 15:37:53,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2022-11-25 15:37:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2022-11-25 15:37:53,819 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2022-11-25 15:37:53,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2022-11-25 15:37:53,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2022-11-25 15:37:53,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:53,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2022-11-25 15:37:53,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 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-25 15:37:53,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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-25 15:37:53,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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-25 15:37:53,826 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 338 transitions. [2022-11-25 15:37:53,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2022-11-25 15:37:53,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:37:53,828 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2022-11-25 15:37:53,828 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-11-25 15:37:53,829 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-11-25 15:37:53,829 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2022-11-25 15:37:53,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-25 15:37:53,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:53,830 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:37:53,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:54,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:54,042 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash 447808, now seen corresponding path program 1 times [2022-11-25 15:37:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:54,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920207987] [2022-11-25 15:37:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:54,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:54,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:54,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:37:54,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 15:37:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:54,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:37:54,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:54,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:54,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 15:37:54,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 15:37:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:54,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:54,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:54,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920207987] [2022-11-25 15:37:54,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920207987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:54,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:54,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:37:54,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393687680] [2022-11-25 15:37:54,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:54,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:37:54,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:54,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:37:54,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:37:54,441 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2022-11-25 15:37:54,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-25 15:37:54,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:54,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2022-11-25 15:37:54,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:54,580 INFO L130 PetriNetUnfolder]: 24/64 cut-off events. [2022-11-25 15:37:54,580 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:37:54,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 64 events. 24/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 166 event pairs, 15 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 131. Up to 61 conditions per place. [2022-11-25 15:37:54,581 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-11-25 15:37:54,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 114 flow [2022-11-25 15:37:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2022-11-25 15:37:54,586 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2022-11-25 15:37:54,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2022-11-25 15:37:54,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2022-11-25 15:37:54,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:54,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2022-11-25 15:37:54,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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-25 15:37:54,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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-25 15:37:54,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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-25 15:37:54,591 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 348 transitions. [2022-11-25 15:37:54,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 114 flow [2022-11-25 15:37:54,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:54,593 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 64 flow [2022-11-25 15:37:54,593 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2022-11-25 15:37:54,594 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2022-11-25 15:37:54,594 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 64 flow [2022-11-25 15:37:54,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-25 15:37:54,595 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:54,595 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-11-25 15:37:54,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:54,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:54,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:54,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash 13883239, now seen corresponding path program 1 times [2022-11-25 15:37:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:54,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816815231] [2022-11-25 15:37:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:54,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:54,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:54,818 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:37:54,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 15:37:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:54,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 15:37:54,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:54,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:54,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 15:37:54,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 15:37:55,027 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:37:55,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 15:37:55,090 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-25 15:37:55,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:55,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:55,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816815231] [2022-11-25 15:37:55,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816815231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:55,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:55,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:37:55,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091363260] [2022-11-25 15:37:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:55,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:37:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:55,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:37:55,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:37:55,304 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 246 [2022-11-25 15:37:55,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 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-25 15:37:55,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:55,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 246 [2022-11-25 15:37:55,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:55,514 INFO L130 PetriNetUnfolder]: 24/63 cut-off events. [2022-11-25 15:37:55,515 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 15:37:55,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 63 events. 24/63 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 164 event pairs, 15 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 132. Up to 58 conditions per place. [2022-11-25 15:37:55,516 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 22 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2022-11-25 15:37:55,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 112 flow [2022-11-25 15:37:55,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:37:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:37:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2022-11-25 15:37:55,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4532520325203252 [2022-11-25 15:37:55,519 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2022-11-25 15:37:55,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2022-11-25 15:37:55,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:55,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2022-11-25 15:37:55,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-25 15:37:55,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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-25 15:37:55,524 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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-25 15:37:55,525 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 64 flow. Second operand 4 states and 446 transitions. [2022-11-25 15:37:55,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 112 flow [2022-11-25 15:37:55,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:37:55,526 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 60 flow [2022-11-25 15:37:55,526 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2022-11-25 15:37:55,527 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-11-25 15:37:55,527 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 60 flow [2022-11-25 15:37:55,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 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-25 15:37:55,528 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:55,528 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:37:55,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:55,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:55,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash 456091316, now seen corresponding path program 1 times [2022-11-25 15:37:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:55,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438181274] [2022-11-25 15:37:55,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:55,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:55,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:55,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:37:55,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 15:37:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:55,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:37:55,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:55,885 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:37:55,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 15:37:55,911 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 15:37:55,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2022-11-25 15:37:55,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:55,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:37:55,992 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 15:37:55,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 15:37:56,011 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-25 15:37:56,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:56,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:56,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438181274] [2022-11-25 15:37:56,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438181274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:56,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:56,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:37:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88003525] [2022-11-25 15:37:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:56,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:37:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:56,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:37:56,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:37:56,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 246 [2022-11-25 15:37:56,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-25 15:37:56,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:56,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 246 [2022-11-25 15:37:56,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:56,348 INFO L130 PetriNetUnfolder]: 10/35 cut-off events. [2022-11-25 15:37:56,349 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 15:37:56,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 35 events. 10/35 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 61 event pairs, 6 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 75. Up to 33 conditions per place. [2022-11-25 15:37:56,349 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2022-11-25 15:37:56,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 21 transitions, 92 flow [2022-11-25 15:37:56,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-11-25 15:37:56,352 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44308943089430897 [2022-11-25 15:37:56,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2022-11-25 15:37:56,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2022-11-25 15:37:56,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:56,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2022-11-25 15:37:56,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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-25 15:37:56,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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-25 15:37:56,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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-25 15:37:56,355 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 60 flow. Second operand 3 states and 327 transitions. [2022-11-25 15:37:56,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 21 transitions, 92 flow [2022-11-25 15:37:56,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:37:56,357 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2022-11-25 15:37:56,357 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-11-25 15:37:56,357 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2022-11-25 15:37:56,358 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2022-11-25 15:37:56,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-25 15:37:56,359 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:56,359 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:56,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:56,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:56,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1859859302, now seen corresponding path program 1 times [2022-11-25 15:37:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:56,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600220968] [2022-11-25 15:37:56,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:56,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:56,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:56,579 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:37:56,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 15:37:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:56,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 15:37:56,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:56,747 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-25 15:37:56,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 42 [2022-11-25 15:37:56,922 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2022-11-25 15:37:56,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 64 [2022-11-25 15:37:57,155 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-25 15:37:57,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:57,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:57,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600220968] [2022-11-25 15:37:57,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600220968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:57,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:57,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:37:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637384248] [2022-11-25 15:37:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:57,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:37:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:57,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:37:57,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:37:57,681 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 246 [2022-11-25 15:37:57,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-25 15:37:57,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:57,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 246 [2022-11-25 15:37:57,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:57,843 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2022-11-25 15:37:57,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:37:57,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 40 events. 10/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 91 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 85. Up to 21 conditions per place. [2022-11-25 15:37:57,844 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2022-11-25 15:37:57,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 115 flow [2022-11-25 15:37:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:37:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:37:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2022-11-25 15:37:57,846 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44613821138211385 [2022-11-25 15:37:57,846 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2022-11-25 15:37:57,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2022-11-25 15:37:57,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:57,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2022-11-25 15:37:57,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 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-25 15:37:57,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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-25 15:37:57,851 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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-25 15:37:57,851 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 50 flow. Second operand 4 states and 439 transitions. [2022-11-25 15:37:57,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 115 flow [2022-11-25 15:37:57,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:57,852 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 54 flow [2022-11-25 15:37:57,852 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-11-25 15:37:57,853 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2022-11-25 15:37:57,853 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2022-11-25 15:37:57,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 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-25 15:37:57,854 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:57,854 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:57,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:58,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:58,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:37:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:58,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1859859244, now seen corresponding path program 1 times [2022-11-25 15:37:58,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:58,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754066585] [2022-11-25 15:37:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:58,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:58,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:58,057 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:37:58,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 15:37:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:58,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 15:37:58,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:58,259 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-25 15:37:58,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-25 15:37:58,307 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 15:37:58,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-11-25 15:37:58,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:58,484 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 15:37:58,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-11-25 15:37:58,534 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2022-11-25 15:37:58,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2022-11-25 15:37:58,814 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-25 15:37:58,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:58,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:58,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754066585] [2022-11-25 15:37:58,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754066585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:58,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:58,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:37:58,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712507592] [2022-11-25 15:37:58,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:58,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:37:58,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:58,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:37:58,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:37:59,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2022-11-25 15:37:59,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 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-25 15:37:59,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:59,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2022-11-25 15:37:59,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:59,880 INFO L130 PetriNetUnfolder]: 14/57 cut-off events. [2022-11-25 15:37:59,881 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 15:37:59,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 57 events. 14/57 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 175 event pairs, 6 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 122. Up to 35 conditions per place. [2022-11-25 15:37:59,881 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 25 selfloop transitions, 7 changer transitions 0/32 dead transitions. [2022-11-25 15:37:59,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 143 flow [2022-11-25 15:37:59,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:37:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:37:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 760 transitions. [2022-11-25 15:37:59,885 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4413472706155633 [2022-11-25 15:37:59,885 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 760 transitions. [2022-11-25 15:37:59,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 760 transitions. [2022-11-25 15:37:59,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:59,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 760 transitions. [2022-11-25 15:37:59,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 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-25 15:37:59,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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-25 15:37:59,891 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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-25 15:37:59,891 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 7 states and 760 transitions. [2022-11-25 15:37:59,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 143 flow [2022-11-25 15:37:59,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:37:59,893 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 77 flow [2022-11-25 15:37:59,893 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=77, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2022-11-25 15:37:59,894 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2022-11-25 15:37:59,894 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 77 flow [2022-11-25 15:37:59,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 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-25 15:37:59,895 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:59,895 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:59,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:38:00,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:00,115 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:38:00,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1859859218, now seen corresponding path program 1 times [2022-11-25 15:38:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:38:00,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988504714] [2022-11-25 15:38:00,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:00,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:00,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:38:00,123 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:38:00,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 15:38:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:00,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:38:00,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:38:00,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 15:38:00,261 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-25 15:38:00,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:38:00,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:00,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988504714] [2022-11-25 15:38:00,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988504714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:00,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:00,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:38:00,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687198169] [2022-11-25 15:38:00,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:00,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:38:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:38:00,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:38:00,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:38:00,451 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2022-11-25 15:38:00,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 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-25 15:38:00,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:00,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2022-11-25 15:38:00,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:00,587 INFO L130 PetriNetUnfolder]: 12/48 cut-off events. [2022-11-25 15:38:00,588 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-25 15:38:00,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 48 events. 12/48 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 118. Up to 29 conditions per place. [2022-11-25 15:38:00,588 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 21 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2022-11-25 15:38:00,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 136 flow [2022-11-25 15:38:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:38:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:38:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 443 transitions. [2022-11-25 15:38:00,593 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4502032520325203 [2022-11-25 15:38:00,593 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 443 transitions. [2022-11-25 15:38:00,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 443 transitions. [2022-11-25 15:38:00,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:00,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 443 transitions. [2022-11-25 15:38:00,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 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-25 15:38:00,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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-25 15:38:00,597 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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-25 15:38:00,597 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 77 flow. Second operand 4 states and 443 transitions. [2022-11-25 15:38:00,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 136 flow [2022-11-25 15:38:00,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:38:00,600 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 80 flow [2022-11-25 15:38:00,600 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-11-25 15:38:00,604 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-11-25 15:38:00,604 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 80 flow [2022-11-25 15:38:00,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 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-25 15:38:00,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:00,605 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:00,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 15:38:00,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:00,818 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:38:00,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:00,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1859859188, now seen corresponding path program 1 times [2022-11-25 15:38:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:38:00,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771045160] [2022-11-25 15:38:00,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:00,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:00,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:38:00,820 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:38:00,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 15:38:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:00,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 15:38:00,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:38:00,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:38:00,980 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-25 15:38:00,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:38:00,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:00,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771045160] [2022-11-25 15:38:00,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771045160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:00,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:00,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:38:00,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357551571] [2022-11-25 15:38:00,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:00,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:38:00,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:38:00,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:38:00,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:38:01,243 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2022-11-25 15:38:01,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 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-25 15:38:01,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:01,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2022-11-25 15:38:01,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:01,388 INFO L130 PetriNetUnfolder]: 11/42 cut-off events. [2022-11-25 15:38:01,388 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-25 15:38:01,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 42 events. 11/42 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 99 event pairs, 5 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 112. Up to 30 conditions per place. [2022-11-25 15:38:01,389 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2022-11-25 15:38:01,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 139 flow [2022-11-25 15:38:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:38:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:38:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 443 transitions. [2022-11-25 15:38:01,391 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4502032520325203 [2022-11-25 15:38:01,391 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 443 transitions. [2022-11-25 15:38:01,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 443 transitions. [2022-11-25 15:38:01,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:01,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 443 transitions. [2022-11-25 15:38:01,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 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-25 15:38:01,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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-25 15:38:01,395 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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-25 15:38:01,396 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 80 flow. Second operand 4 states and 443 transitions. [2022-11-25 15:38:01,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 139 flow [2022-11-25 15:38:01,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 129 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:38:01,397 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 78 flow [2022-11-25 15:38:01,397 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-11-25 15:38:01,398 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-11-25 15:38:01,398 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 78 flow [2022-11-25 15:38:01,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 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-25 15:38:01,399 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:01,399 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:01,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:38:01,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:01,599 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:38:01,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1821058871, now seen corresponding path program 1 times [2022-11-25 15:38:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:38:01,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629849400] [2022-11-25 15:38:01,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:01,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:01,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:38:01,601 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:38:01,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 15:38:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:01,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 15:38:01,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:38:01,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:38:01,787 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 15:38:01,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2022-11-25 15:38:01,852 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-25 15:38:01,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-25 15:38:01,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:38:02,022 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 15:38:02,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-11-25 15:38:02,074 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2022-11-25 15:38:02,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2022-11-25 15:38:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:02,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:38:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:02,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:02,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629849400] [2022-11-25 15:38:02,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629849400] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:38:02,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:38:02,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2022-11-25 15:38:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615316197] [2022-11-25 15:38:02,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:38:02,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:38:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:38:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:38:02,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:38:04,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:06,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:08,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:10,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:13,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:15,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:17,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:20,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:22,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:24,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:26,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:28,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:30,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:33,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:35,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:37,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:39,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:41,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:41,508 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 246 [2022-11-25 15:38:41,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 78 flow. Second operand has 10 states, 10 states have (on average 80.0) internal successors, (800), 10 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-25 15:38:41,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:41,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 246 [2022-11-25 15:38:41,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:42,871 INFO L130 PetriNetUnfolder]: 21/73 cut-off events. [2022-11-25 15:38:42,871 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-25 15:38:42,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 73 events. 21/73 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 210 event pairs, 3 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 192. Up to 20 conditions per place. [2022-11-25 15:38:42,872 INFO L137 encePairwiseOnDemand]: 238/246 looper letters, 31 selfloop transitions, 14 changer transitions 0/45 dead transitions. [2022-11-25 15:38:42,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 240 flow [2022-11-25 15:38:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 15:38:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-25 15:38:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1062 transitions. [2022-11-25 15:38:42,879 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3320825515947467 [2022-11-25 15:38:42,879 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1062 transitions. [2022-11-25 15:38:42,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1062 transitions. [2022-11-25 15:38:42,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:42,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1062 transitions. [2022-11-25 15:38:42,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 81.6923076923077) internal successors, (1062), 13 states have internal predecessors, (1062), 0 states have call successors, (0), 0 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-25 15:38:42,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 246.0) internal successors, (3444), 14 states have internal predecessors, (3444), 0 states have call successors, (0), 0 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-25 15:38:42,890 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 246.0) internal successors, (3444), 14 states have internal predecessors, (3444), 0 states have call successors, (0), 0 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-25 15:38:42,890 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 78 flow. Second operand 13 states and 1062 transitions. [2022-11-25 15:38:42,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 240 flow [2022-11-25 15:38:42,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:38:42,892 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 157 flow [2022-11-25 15:38:42,893 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=157, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2022-11-25 15:38:42,893 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-11-25 15:38:42,893 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 157 flow [2022-11-25 15:38:42,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.0) internal successors, (800), 10 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-25 15:38:42,894 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:42,894 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:42,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-11-25 15:38:43,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:43,106 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:38:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1821058815, now seen corresponding path program 1 times [2022-11-25 15:38:43,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:38:43,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078718238] [2022-11-25 15:38:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:43,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:43,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:38:43,108 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:38:43,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 15:38:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:43,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:38:43,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:38:43,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:38:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:43,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:38:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:43,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:43,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078718238] [2022-11-25 15:38:43,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078718238] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:38:43,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:38:43,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-11-25 15:38:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738450738] [2022-11-25 15:38:43,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:38:43,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:38:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:38:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:38:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:38:44,554 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 246 [2022-11-25 15:38:44,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 157 flow. Second operand has 8 states, 8 states have (on average 103.125) internal successors, (825), 8 states have internal predecessors, (825), 0 states have call successors, (0), 0 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-25 15:38:44,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:44,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 246 [2022-11-25 15:38:44,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:45,009 INFO L130 PetriNetUnfolder]: 17/65 cut-off events. [2022-11-25 15:38:45,009 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-11-25 15:38:45,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 65 events. 17/65 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 168 event pairs, 4 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 218. Up to 24 conditions per place. [2022-11-25 15:38:45,011 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 35 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2022-11-25 15:38:45,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 277 flow [2022-11-25 15:38:45,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:38:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:38:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2022-11-25 15:38:45,015 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4367015098722416 [2022-11-25 15:38:45,015 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 752 transitions. [2022-11-25 15:38:45,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 752 transitions. [2022-11-25 15:38:45,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:45,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 752 transitions. [2022-11-25 15:38:45,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 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-25 15:38:45,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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-25 15:38:45,026 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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-25 15:38:45,026 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 157 flow. Second operand 7 states and 752 transitions. [2022-11-25 15:38:45,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 277 flow [2022-11-25 15:38:45,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 249 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-11-25 15:38:45,034 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 137 flow [2022-11-25 15:38:45,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2022-11-25 15:38:45,035 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-11-25 15:38:45,035 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 137 flow [2022-11-25 15:38:45,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.125) internal successors, (825), 8 states have internal predecessors, (825), 0 states have call successors, (0), 0 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-25 15:38:45,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:45,036 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:45,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 15:38:45,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:45,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:38:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:45,250 INFO L85 PathProgramCache]: Analyzing trace with hash -618584227, now seen corresponding path program 1 times [2022-11-25 15:38:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:38:45,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352632175] [2022-11-25 15:38:45,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:45,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:45,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:38:45,252 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:38:45,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 15:38:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:45,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 15:38:45,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:38:45,375 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-25 15:38:45,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:38:45,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:45,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352632175] [2022-11-25 15:38:45,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352632175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:45,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:45,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:38:45,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164757096] [2022-11-25 15:38:45,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:45,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:38:45,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:38:45,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:38:45,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:38:45,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 246 [2022-11-25 15:38:45,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-25 15:38:45,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:45,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 246 [2022-11-25 15:38:45,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:45,499 INFO L130 PetriNetUnfolder]: 16/59 cut-off events. [2022-11-25 15:38:45,499 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-25 15:38:45,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 59 events. 16/59 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 11 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 198. Up to 56 conditions per place. [2022-11-25 15:38:45,500 INFO L137 encePairwiseOnDemand]: 244/246 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2022-11-25 15:38:45,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 25 transitions, 180 flow [2022-11-25 15:38:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:38:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:38:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2022-11-25 15:38:45,505 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2022-11-25 15:38:45,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2022-11-25 15:38:45,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2022-11-25 15:38:45,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:45,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2022-11-25 15:38:45,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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-25 15:38:45,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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-25 15:38:45,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 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-25 15:38:45,509 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 137 flow. Second operand 3 states and 348 transitions. [2022-11-25 15:38:45,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 25 transitions, 180 flow [2022-11-25 15:38:45,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 25 transitions, 167 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-25 15:38:45,512 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 117 flow [2022-11-25 15:38:45,512 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2022-11-25 15:38:45,513 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-11-25 15:38:45,514 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 117 flow [2022-11-25 15:38:45,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-25 15:38:45,514 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:45,514 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:45,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 15:38:45,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:45,727 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:38:45,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2008341103, now seen corresponding path program 1 times [2022-11-25 15:38:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:38:45,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908110566] [2022-11-25 15:38:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:45,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:45,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:38:45,729 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:38:45,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 15:38:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:45,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 15:38:45,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:38:45,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-25 15:38:45,934 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-25 15:38:45,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:38:45,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:45,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908110566] [2022-11-25 15:38:45,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908110566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:45,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:45,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:38:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873560167] [2022-11-25 15:38:45,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:45,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:38:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:38:45,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:38:45,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:38:46,197 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 246 [2022-11-25 15:38:46,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-25 15:38:46,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:46,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 246 [2022-11-25 15:38:46,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:46,354 INFO L130 PetriNetUnfolder]: 16/58 cut-off events. [2022-11-25 15:38:46,354 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-25 15:38:46,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 58 events. 16/58 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 9 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 183. Up to 47 conditions per place. [2022-11-25 15:38:46,355 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 25 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2022-11-25 15:38:46,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 184 flow [2022-11-25 15:38:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:38:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:38:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2022-11-25 15:38:46,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44634146341463415 [2022-11-25 15:38:46,360 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2022-11-25 15:38:46,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2022-11-25 15:38:46,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:46,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2022-11-25 15:38:46,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 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-25 15:38:46,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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-25 15:38:46,365 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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-25 15:38:46,365 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 117 flow. Second operand 5 states and 549 transitions. [2022-11-25 15:38:46,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 184 flow [2022-11-25 15:38:46,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 183 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:38:46,368 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 127 flow [2022-11-25 15:38:46,368 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2022-11-25 15:38:46,369 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-11-25 15:38:46,370 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 127 flow [2022-11-25 15:38:46,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-25 15:38:46,370 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:46,370 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:46,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 15:38:46,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:46,583 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:38:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2008341109, now seen corresponding path program 1 times [2022-11-25 15:38:46,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:38:46,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764778571] [2022-11-25 15:38:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:46,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:46,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:38:46,586 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:38:46,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 15:38:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:46,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 15:38:46,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:38:46,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:38:46,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:38:46,775 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-25 15:38:46,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 15:38:46,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:38:46,858 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-25 15:38:46,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:38:46,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:46,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764778571] [2022-11-25 15:38:46,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764778571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:46,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:46,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:38:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144080579] [2022-11-25 15:38:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:46,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:38:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:38:46,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:38:46,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:38:47,086 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2022-11-25 15:38:47,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 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-25 15:38:47,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:47,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2022-11-25 15:38:47,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:47,211 INFO L130 PetriNetUnfolder]: 15/53 cut-off events. [2022-11-25 15:38:47,211 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-25 15:38:47,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 53 events. 15/53 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 110 event pairs, 2 based on Foata normal form. 2/53 useless extension candidates. Maximal degree in co-relation 185. Up to 38 conditions per place. [2022-11-25 15:38:47,212 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 21 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2022-11-25 15:38:47,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 26 transitions, 182 flow [2022-11-25 15:38:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:38:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:38:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2022-11-25 15:38:47,217 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2022-11-25 15:38:47,217 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 438 transitions. [2022-11-25 15:38:47,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions. [2022-11-25 15:38:47,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:47,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions. [2022-11-25 15:38:47,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 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-25 15:38:47,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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-25 15:38:47,221 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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-25 15:38:47,221 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 127 flow. Second operand 4 states and 438 transitions. [2022-11-25 15:38:47,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 26 transitions, 182 flow [2022-11-25 15:38:47,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 26 transitions, 174 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-25 15:38:47,223 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 135 flow [2022-11-25 15:38:47,223 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2022-11-25 15:38:47,224 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-11-25 15:38:47,224 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 135 flow [2022-11-25 15:38:47,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 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-25 15:38:47,225 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:47,225 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:47,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-11-25 15:38:47,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:47,437 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:38:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2129185294, now seen corresponding path program 1 times [2022-11-25 15:38:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:38:47,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117159475] [2022-11-25 15:38:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:38:47,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:47,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:38:47,440 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:38:47,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 15:38:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:38:47,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 15:38:47,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:38:47,697 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-25 15:38:47,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-25 15:38:47,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:38:47,827 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 15:38:47,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 15:38:47,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:38:47,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:38:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:47,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:38:48,030 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_203) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-25 15:38:50,158 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_~v~0.base_80 (_ BitVec 32))) (or (forall ((v_ArrVal_202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_203 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) v_~v~0.base_80 v_ArrVal_203) (_ bv3 32)) (_ bv1 32))) (_ bv0 8)))) (not (= (_ bv0 1) (select |c_#valid| v_~v~0.base_80))))) is different from false [2022-11-25 15:38:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 15:38:50,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:50,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117159475] [2022-11-25 15:38:50,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117159475] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:38:50,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:38:50,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-11-25 15:38:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179272708] [2022-11-25 15:38:50,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:38:50,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 15:38:50,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:38:50,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 15:38:50,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=65, Unknown=7, NotChecked=34, Total=132 [2022-11-25 15:38:50,226 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 246 [2022-11-25 15:38:50,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 135 flow. Second operand has 12 states, 12 states have (on average 55.0) internal successors, (660), 12 states have internal predecessors, (660), 0 states have call successors, (0), 0 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-25 15:38:50,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:50,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 246 [2022-11-25 15:38:50,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:51,312 INFO L130 PetriNetUnfolder]: 14/47 cut-off events. [2022-11-25 15:38:51,313 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-25 15:38:51,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 47 events. 14/47 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 81 event pairs, 2 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 173. Up to 15 conditions per place. [2022-11-25 15:38:51,314 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 19 selfloop transitions, 9 changer transitions 0/28 dead transitions. [2022-11-25 15:38:51,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 28 transitions, 194 flow [2022-11-25 15:38:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:38:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:38:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 399 transitions. [2022-11-25 15:38:51,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.23170731707317074 [2022-11-25 15:38:51,318 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 399 transitions. [2022-11-25 15:38:51,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 399 transitions. [2022-11-25 15:38:51,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:51,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 399 transitions. [2022-11-25 15:38:51,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:38:51,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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-25 15:38:51,324 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 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-25 15:38:51,325 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 135 flow. Second operand 7 states and 399 transitions. [2022-11-25 15:38:51,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 28 transitions, 194 flow [2022-11-25 15:38:51,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 28 transitions, 184 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-25 15:38:51,328 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 136 flow [2022-11-25 15:38:51,328 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2022-11-25 15:38:51,329 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-11-25 15:38:51,329 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 136 flow [2022-11-25 15:38:51,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 55.0) internal successors, (660), 12 states have internal predecessors, (660), 0 states have call successors, (0), 0 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-25 15:38:51,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:51,330 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:51,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 15:38:51,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:51,543 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:38:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1430085044, now seen corresponding path program 2 times [2022-11-25 15:38:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:38:51,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246938413] [2022-11-25 15:38:51,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:38:51,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:51,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:38:51,546 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:38:51,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-25 15:38:51,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 15:38:51,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:38:51,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 15:38:51,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:38:51,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:38:51,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:38:51,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:38:51,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-25 15:38:51,742 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:38:51,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:38:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 15:38:51,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:38:51,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:51,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246938413] [2022-11-25 15:38:51,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246938413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:38:51,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:38:51,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:38:51,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485413039] [2022-11-25 15:38:51,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:38:51,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:38:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:38:51,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:38:51,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:38:52,148 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 246 [2022-11-25 15:38:52,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-25 15:38:52,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:38:52,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 246 [2022-11-25 15:38:52,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:38:52,281 INFO L130 PetriNetUnfolder]: 13/44 cut-off events. [2022-11-25 15:38:52,282 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-25 15:38:52,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 44 events. 13/44 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 171. Up to 34 conditions per place. [2022-11-25 15:38:52,283 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2022-11-25 15:38:52,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 24 transitions, 182 flow [2022-11-25 15:38:52,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:38:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:38:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2022-11-25 15:38:52,289 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44552845528455287 [2022-11-25 15:38:52,289 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 548 transitions. [2022-11-25 15:38:52,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 548 transitions. [2022-11-25 15:38:52,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:38:52,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 548 transitions. [2022-11-25 15:38:52,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 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-25 15:38:52,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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-25 15:38:52,294 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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-25 15:38:52,295 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 136 flow. Second operand 5 states and 548 transitions. [2022-11-25 15:38:52,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 24 transitions, 182 flow [2022-11-25 15:38:52,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 24 transitions, 159 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-25 15:38:52,297 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 113 flow [2022-11-25 15:38:52,297 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2022-11-25 15:38:52,297 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-11-25 15:38:52,298 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 113 flow [2022-11-25 15:38:52,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-25 15:38:52,298 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:38:52,298 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:38:52,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-11-25 15:38:52,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:52,511 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:38:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:38:52,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1430085100, now seen corresponding path program 2 times [2022-11-25 15:38:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:38:52,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710346341] [2022-11-25 15:38:52,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:38:52,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:38:52,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:38:52,514 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:38:52,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-25 15:38:52,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:38:52,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:38:52,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 15:38:52,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:38:52,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:38:52,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:38:52,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:38:52,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-25 15:38:52,758 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-25 15:38:52,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-25 15:38:52,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:38:52,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:38:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:53,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:38:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:38:53,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:38:53,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710346341] [2022-11-25 15:38:53,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710346341] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:38:53,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:38:53,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2022-11-25 15:38:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981624377] [2022-11-25 15:38:53,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:38:53,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 15:38:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:38:53,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 15:38:53,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:38:56,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:38:58,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:00,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:01,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:02,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:05,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:07,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:09,020 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 246 [2022-11-25 15:39:09,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 113 flow. Second operand has 16 states, 16 states have (on average 85.625) internal successors, (1370), 16 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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-25 15:39:09,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:09,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 246 [2022-11-25 15:39:09,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:10,243 INFO L130 PetriNetUnfolder]: 21/80 cut-off events. [2022-11-25 15:39:10,243 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-11-25 15:39:10,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 80 events. 21/80 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 198 event pairs, 3 based on Foata normal form. 8/88 useless extension candidates. Maximal degree in co-relation 266. Up to 18 conditions per place. [2022-11-25 15:39:10,244 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 35 selfloop transitions, 17 changer transitions 0/52 dead transitions. [2022-11-25 15:39:10,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 334 flow [2022-11-25 15:39:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 15:39:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-25 15:39:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1484 transitions. [2022-11-25 15:39:10,248 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3548541367766619 [2022-11-25 15:39:10,248 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1484 transitions. [2022-11-25 15:39:10,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1484 transitions. [2022-11-25 15:39:10,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:10,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1484 transitions. [2022-11-25 15:39:10,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 87.29411764705883) internal successors, (1484), 17 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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-25 15:39:10,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 246.0) internal successors, (4428), 18 states have internal predecessors, (4428), 0 states have call successors, (0), 0 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-25 15:39:10,260 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 246.0) internal successors, (4428), 18 states have internal predecessors, (4428), 0 states have call successors, (0), 0 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-25 15:39:10,260 INFO L175 Difference]: Start difference. First operand has 40 places, 22 transitions, 113 flow. Second operand 17 states and 1484 transitions. [2022-11-25 15:39:10,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 334 flow [2022-11-25 15:39:10,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 329 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:39:10,263 INFO L231 Difference]: Finished difference. Result has 58 places, 31 transitions, 226 flow [2022-11-25 15:39:10,263 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=226, PETRI_PLACES=58, PETRI_TRANSITIONS=31} [2022-11-25 15:39:10,264 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-11-25 15:39:10,264 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 31 transitions, 226 flow [2022-11-25 15:39:10,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 85.625) internal successors, (1370), 16 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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-25 15:39:10,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:10,265 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:10,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 15:39:10,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:39:10,478 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:39:10,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1580387919, now seen corresponding path program 2 times [2022-11-25 15:39:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:10,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914507128] [2022-11-25 15:39:10,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:39:10,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:39:10,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:10,480 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:39:10,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 15:39:10,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:39:10,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:39:10,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 15:39:10,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:10,778 INFO L321 Elim1Store]: treesize reduction 118, result has 24.4 percent of original size [2022-11-25 15:39:10,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 65 [2022-11-25 15:39:10,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:11,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:39:11,033 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 15:39:11,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 27 [2022-11-25 15:39:11,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:39:11,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:12,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:12,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:12,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:39:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:15,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:15,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914507128] [2022-11-25 15:39:15,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914507128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:39:15,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:39:15,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-11-25 15:39:15,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438933752] [2022-11-25 15:39:15,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:39:15,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 15:39:15,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:15,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 15:39:15,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=147, Unknown=1, NotChecked=0, Total=182 [2022-11-25 15:39:19,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:22,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:24,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:26,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:29,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:31,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:33,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:34,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 246 [2022-11-25 15:39:34,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 31 transitions, 226 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 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-25 15:39:34,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:34,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 246 [2022-11-25 15:39:34,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:36,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:39:46,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:47,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:39:47,737 INFO L130 PetriNetUnfolder]: 20/74 cut-off events. [2022-11-25 15:39:47,738 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-11-25 15:39:47,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 74 events. 20/74 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 171 event pairs, 1 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 304. Up to 47 conditions per place. [2022-11-25 15:39:47,739 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 25 selfloop transitions, 13 changer transitions 0/38 dead transitions. [2022-11-25 15:39:47,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 38 transitions, 319 flow [2022-11-25 15:39:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:39:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 15:39:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 632 transitions. [2022-11-25 15:39:47,745 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.25691056910569104 [2022-11-25 15:39:47,745 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 632 transitions. [2022-11-25 15:39:47,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 632 transitions. [2022-11-25 15:39:47,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:47,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 632 transitions. [2022-11-25 15:39:47,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 63.2) internal successors, (632), 10 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-25 15:39:47,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 246.0) internal successors, (2706), 11 states have internal predecessors, (2706), 0 states have call successors, (0), 0 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-25 15:39:47,759 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 246.0) internal successors, (2706), 11 states have internal predecessors, (2706), 0 states have call successors, (0), 0 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-25 15:39:47,759 INFO L175 Difference]: Start difference. First operand has 58 places, 31 transitions, 226 flow. Second operand 10 states and 632 transitions. [2022-11-25 15:39:47,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 38 transitions, 319 flow [2022-11-25 15:39:47,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 38 transitions, 276 flow, removed 5 selfloop flow, removed 8 redundant places. [2022-11-25 15:39:47,763 INFO L231 Difference]: Finished difference. Result has 57 places, 31 transitions, 214 flow [2022-11-25 15:39:47,763 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2022-11-25 15:39:47,763 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-11-25 15:39:47,764 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 31 transitions, 214 flow [2022-11-25 15:39:47,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 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-25 15:39:47,764 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:47,765 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:47,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 15:39:47,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:39:47,978 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:39:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash 76747590, now seen corresponding path program 1 times [2022-11-25 15:39:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:47,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417162254] [2022-11-25 15:39:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:47,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:39:47,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:47,980 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:39:47,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-25 15:39:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 15:39:48,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:48,247 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-25 15:39:48,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-25 15:39:48,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:48,398 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 15:39:48,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 15:39:48,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:48,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:48,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:48,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:48,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:39:48,860 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_306) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv2 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-25 15:39:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 15:39:53,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:53,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417162254] [2022-11-25 15:39:53,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417162254] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:39:53,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:39:53,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-25 15:39:53,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266843238] [2022-11-25 15:39:53,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:39:53,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 15:39:53,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:53,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 15:39:53,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=163, Unknown=14, NotChecked=26, Total=240 [2022-11-25 15:39:54,494 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 246 [2022-11-25 15:39:54,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 31 transitions, 214 flow. Second operand has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-25 15:39:54,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:54,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 246 [2022-11-25 15:39:54,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:55,697 INFO L130 PetriNetUnfolder]: 19/68 cut-off events. [2022-11-25 15:39:55,697 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-11-25 15:39:55,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 68 events. 19/68 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 147 event pairs, 2 based on Foata normal form. 2/70 useless extension candidates. Maximal degree in co-relation 267. Up to 27 conditions per place. [2022-11-25 15:39:55,698 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 24 selfloop transitions, 11 changer transitions 0/35 dead transitions. [2022-11-25 15:39:55,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 35 transitions, 284 flow [2022-11-25 15:39:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:39:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:39:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 452 transitions. [2022-11-25 15:39:55,702 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.22967479674796748 [2022-11-25 15:39:55,702 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 452 transitions. [2022-11-25 15:39:55,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 452 transitions. [2022-11-25 15:39:55,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:55,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 452 transitions. [2022-11-25 15:39:55,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 56.5) internal successors, (452), 8 states have internal predecessors, (452), 0 states have call successors, (0), 0 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-25 15:39:55,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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-25 15:39:55,707 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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-25 15:39:55,708 INFO L175 Difference]: Start difference. First operand has 57 places, 31 transitions, 214 flow. Second operand 8 states and 452 transitions. [2022-11-25 15:39:55,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 35 transitions, 284 flow [2022-11-25 15:39:55,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 35 transitions, 256 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-11-25 15:39:55,711 INFO L231 Difference]: Finished difference. Result has 56 places, 29 transitions, 196 flow [2022-11-25 15:39:55,711 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=196, PETRI_PLACES=56, PETRI_TRANSITIONS=29} [2022-11-25 15:39:55,712 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-11-25 15:39:55,712 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 29 transitions, 196 flow [2022-11-25 15:39:55,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-25 15:39:55,713 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:55,713 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:55,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-25 15:39:55,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:39:55,927 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:39:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:55,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1882877061, now seen corresponding path program 2 times [2022-11-25 15:39:55,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:39:55,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393947419] [2022-11-25 15:39:55,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:39:55,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:39:55,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:39:55,929 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:39:55,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-25 15:39:56,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:39:56,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:39:56,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 15:39:56,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:39:56,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:39:56,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:56,180 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-25 15:39:56,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2022-11-25 15:39:56,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:39:56,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:39:56,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:39:56,374 INFO L321 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2022-11-25 15:39:56,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 26 [2022-11-25 15:39:56,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:39:56,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:39:56,479 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:39:56,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2022-11-25 15:39:56,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:39:56,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:39:56,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:39:56,574 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:39:56,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 15:39:56,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:39:56,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:39:56,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:39:56,682 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:39:56,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2022-11-25 15:39:56,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:39:56,792 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 15:39:56,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 15:39:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:56,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:39:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:57,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:39:57,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393947419] [2022-11-25 15:39:57,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393947419] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:39:57,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:39:57,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2022-11-25 15:39:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086014066] [2022-11-25 15:39:57,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:39:57,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 15:39:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:39:57,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 15:39:57,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=246, Unknown=2, NotChecked=0, Total=342 [2022-11-25 15:40:05,813 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 246 [2022-11-25 15:40:05,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 29 transitions, 196 flow. Second operand has 19 states, 19 states have (on average 67.6842105263158) internal successors, (1286), 19 states have internal predecessors, (1286), 0 states have call successors, (0), 0 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-25 15:40:05,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:05,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 246 [2022-11-25 15:40:05,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:11,061 INFO L130 PetriNetUnfolder]: 28/98 cut-off events. [2022-11-25 15:40:11,061 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2022-11-25 15:40:11,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 98 events. 28/98 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 254 event pairs, 1 based on Foata normal form. 6/104 useless extension candidates. Maximal degree in co-relation 423. Up to 24 conditions per place. [2022-11-25 15:40:11,063 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 45 selfloop transitions, 16 changer transitions 0/61 dead transitions. [2022-11-25 15:40:11,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 61 transitions, 508 flow [2022-11-25 15:40:11,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 15:40:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-25 15:40:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1123 transitions. [2022-11-25 15:40:11,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2853150406504065 [2022-11-25 15:40:11,067 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1123 transitions. [2022-11-25 15:40:11,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1123 transitions. [2022-11-25 15:40:11,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:11,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1123 transitions. [2022-11-25 15:40:11,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 70.1875) internal successors, (1123), 16 states have internal predecessors, (1123), 0 states have call successors, (0), 0 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-25 15:40:11,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 246.0) internal successors, (4182), 17 states have internal predecessors, (4182), 0 states have call successors, (0), 0 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-25 15:40:11,076 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 246.0) internal successors, (4182), 17 states have internal predecessors, (4182), 0 states have call successors, (0), 0 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-25 15:40:11,077 INFO L175 Difference]: Start difference. First operand has 56 places, 29 transitions, 196 flow. Second operand 16 states and 1123 transitions. [2022-11-25 15:40:11,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 61 transitions, 508 flow [2022-11-25 15:40:11,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 477 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-25 15:40:11,081 INFO L231 Difference]: Finished difference. Result has 71 places, 33 transitions, 269 flow [2022-11-25 15:40:11,082 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=269, PETRI_PLACES=71, PETRI_TRANSITIONS=33} [2022-11-25 15:40:11,082 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 35 predicate places. [2022-11-25 15:40:11,082 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 33 transitions, 269 flow [2022-11-25 15:40:11,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 67.6842105263158) internal successors, (1286), 19 states have internal predecessors, (1286), 0 states have call successors, (0), 0 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-25 15:40:11,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:11,083 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:11,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-25 15:40:11,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:40:11,294 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:40:11,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1660728785, now seen corresponding path program 3 times [2022-11-25 15:40:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:40:11,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862347457] [2022-11-25 15:40:11,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:40:11,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:40:11,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:40:11,296 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:40:11,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-25 15:40:11,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 15:40:11,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:40:11,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 15:40:11,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:40:11,727 INFO L321 Elim1Store]: treesize reduction 118, result has 24.4 percent of original size [2022-11-25 15:40:11,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 65 [2022-11-25 15:40:11,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:11,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:40:12,019 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 15:40:12,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 27 [2022-11-25 15:40:12,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:40:12,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:13,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:13,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:13,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:13,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:14,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:40:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:15,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:40:15,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862347457] [2022-11-25 15:40:15,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862347457] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:40:15,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:40:15,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2022-11-25 15:40:15,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803980249] [2022-11-25 15:40:15,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:40:15,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 15:40:15,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:40:15,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 15:40:15,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=252, Unknown=9, NotChecked=0, Total=306 [2022-11-25 15:40:21,045 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 246 [2022-11-25 15:40:21,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 33 transitions, 269 flow. Second operand has 18 states, 18 states have (on average 55.666666666666664) internal successors, (1002), 18 states have internal predecessors, (1002), 0 states have call successors, (0), 0 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-25 15:40:21,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:21,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 246 [2022-11-25 15:40:21,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:24,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:40:31,514 WARN L837 $PredicateComparison]: unable to prove that (and (= (bvadd (select |c_#valid| (_ bv3 32)) (_ bv1 1)) (_ bv0 1)) (bvult |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= (bvadd (select |c_#valid| (_ bv2 32)) (_ bv1 1)) (_ bv0 1)) (let ((.cse0 (select |c_#length| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base|))) (or (forall ((v_ArrVal_373 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_373) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv3 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) (not (bvult (bvadd (_ bv2 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse0)) (not (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| (_ bv3 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse0)))) (= ((_ sign_extend 24) (_ bv104 8)) (select (select |c_#memory_int| (_ bv3 32)) (_ bv4 32))) (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (bvult |c_#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_~#t1~0#1.base| (_ bv3 32))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| (_ bv2 32))) (= (_ bv0 1) (bvadd (select |c_#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))))) (not (= (_ bv2 32) |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-11-25 15:40:34,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:40:35,864 INFO L130 PetriNetUnfolder]: 28/100 cut-off events. [2022-11-25 15:40:35,864 INFO L131 PetriNetUnfolder]: For 399/399 co-relation queries the response was YES. [2022-11-25 15:40:35,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 100 events. 28/100 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 267 event pairs, 0 based on Foata normal form. 7/107 useless extension candidates. Maximal degree in co-relation 489. Up to 43 conditions per place. [2022-11-25 15:40:35,865 INFO L137 encePairwiseOnDemand]: 238/246 looper letters, 31 selfloop transitions, 27 changer transitions 0/58 dead transitions. [2022-11-25 15:40:35,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 58 transitions, 543 flow [2022-11-25 15:40:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 15:40:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-25 15:40:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1080 transitions. [2022-11-25 15:40:35,869 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.23106546854942234 [2022-11-25 15:40:35,869 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1080 transitions. [2022-11-25 15:40:35,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1080 transitions. [2022-11-25 15:40:35,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:35,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1080 transitions. [2022-11-25 15:40:35,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 56.8421052631579) internal successors, (1080), 19 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-25 15:40:35,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 246.0) internal successors, (4920), 20 states have internal predecessors, (4920), 0 states have call successors, (0), 0 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-25 15:40:35,878 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 246.0) internal successors, (4920), 20 states have internal predecessors, (4920), 0 states have call successors, (0), 0 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-25 15:40:35,878 INFO L175 Difference]: Start difference. First operand has 71 places, 33 transitions, 269 flow. Second operand 19 states and 1080 transitions. [2022-11-25 15:40:35,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 58 transitions, 543 flow [2022-11-25 15:40:35,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 58 transitions, 498 flow, removed 8 selfloop flow, removed 11 redundant places. [2022-11-25 15:40:35,883 INFO L231 Difference]: Finished difference. Result has 80 places, 43 transitions, 399 flow [2022-11-25 15:40:35,884 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=399, PETRI_PLACES=80, PETRI_TRANSITIONS=43} [2022-11-25 15:40:35,884 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 44 predicate places. [2022-11-25 15:40:35,884 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 43 transitions, 399 flow [2022-11-25 15:40:35,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 55.666666666666664) internal successors, (1002), 18 states have internal predecessors, (1002), 0 states have call successors, (0), 0 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-25 15:40:35,885 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:35,885 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:35,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-25 15:40:36,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:40:36,099 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:40:36,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:36,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1793268204, now seen corresponding path program 4 times [2022-11-25 15:40:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:40:36,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837363090] [2022-11-25 15:40:36,099 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:40:36,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:40:36,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:40:36,100 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:40:36,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-25 15:40:36,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:40:36,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:40:36,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 15:40:36,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:40:36,387 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-25 15:40:36,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-25 15:40:36,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:36,522 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 15:40:36,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 15:40:36,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:36,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:36,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:36,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:36,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:36,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:37,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:40:37,175 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_408) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv2 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-25 15:40:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-25 15:40:39,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:40:39,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837363090] [2022-11-25 15:40:39,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837363090] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:40:39,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:40:39,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-11-25 15:40:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666418422] [2022-11-25 15:40:39,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:40:39,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 15:40:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:40:39,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 15:40:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=263, Unknown=36, NotChecked=34, Total=380 [2022-11-25 15:40:40,103 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 246 [2022-11-25 15:40:40,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 43 transitions, 399 flow. Second operand has 20 states, 20 states have (on average 54.6) internal successors, (1092), 20 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-25 15:40:40,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:40,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 246 [2022-11-25 15:40:40,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:41,772 INFO L130 PetriNetUnfolder]: 26/92 cut-off events. [2022-11-25 15:40:41,772 INFO L131 PetriNetUnfolder]: For 463/463 co-relation queries the response was YES. [2022-11-25 15:40:41,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 92 events. 26/92 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 219 event pairs, 2 based on Foata normal form. 3/95 useless extension candidates. Maximal degree in co-relation 496. Up to 35 conditions per place. [2022-11-25 15:40:41,773 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 29 selfloop transitions, 17 changer transitions 0/46 dead transitions. [2022-11-25 15:40:41,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 46 transitions, 474 flow [2022-11-25 15:40:41,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:40:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 15:40:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 562 transitions. [2022-11-25 15:40:41,777 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.22845528455284553 [2022-11-25 15:40:41,777 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 562 transitions. [2022-11-25 15:40:41,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 562 transitions. [2022-11-25 15:40:41,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:41,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 562 transitions. [2022-11-25 15:40:41,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 56.2) internal successors, (562), 10 states have internal predecessors, (562), 0 states have call successors, (0), 0 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-25 15:40:41,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 246.0) internal successors, (2706), 11 states have internal predecessors, (2706), 0 states have call successors, (0), 0 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-25 15:40:41,782 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 246.0) internal successors, (2706), 11 states have internal predecessors, (2706), 0 states have call successors, (0), 0 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-25 15:40:41,782 INFO L175 Difference]: Start difference. First operand has 80 places, 43 transitions, 399 flow. Second operand 10 states and 562 transitions. [2022-11-25 15:40:41,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 46 transitions, 474 flow [2022-11-25 15:40:41,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 46 transitions, 394 flow, removed 19 selfloop flow, removed 15 redundant places. [2022-11-25 15:40:41,787 INFO L231 Difference]: Finished difference. Result has 72 places, 39 transitions, 308 flow [2022-11-25 15:40:41,788 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=308, PETRI_PLACES=72, PETRI_TRANSITIONS=39} [2022-11-25 15:40:41,788 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 36 predicate places. [2022-11-25 15:40:41,788 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 39 transitions, 308 flow [2022-11-25 15:40:41,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 54.6) internal successors, (1092), 20 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-25 15:40:41,789 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:41,789 INFO L209 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:41,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-25 15:40:42,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:40:42,003 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:40:42,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash -915246529, now seen corresponding path program 5 times [2022-11-25 15:40:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:40:42,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733113029] [2022-11-25 15:40:42,003 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 15:40:42,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:40:42,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:40:42,005 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:40:42,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-25 15:40:42,336 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-25 15:40:42,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:40:42,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 15:40:42,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:40:42,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:40:42,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:40:42,448 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-11-25 15:40:42,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 50 [2022-11-25 15:40:42,490 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 15:40:42,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-25 15:40:42,703 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 15:40:42,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2022-11-25 15:40:42,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:40:42,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:43,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:43,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:43,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:43,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:43,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:43,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:43,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:40:44,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_445) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv2 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-25 15:40:44,116 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_445) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv3 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-25 15:40:44,225 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_445) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv5 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-25 15:40:44,237 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_445) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv6 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) is different from false [2022-11-25 15:40:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-25 15:40:44,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:40:44,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733113029] [2022-11-25 15:40:44,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733113029] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:40:44,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:40:44,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-25 15:40:44,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8635911] [2022-11-25 15:40:44,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:40:44,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 15:40:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:40:44,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 15:40:44,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=16, NotChecked=140, Total=462 [2022-11-25 15:40:44,749 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 246 [2022-11-25 15:40:44,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 39 transitions, 308 flow. Second operand has 22 states, 22 states have (on average 53.54545454545455) internal successors, (1178), 22 states have internal predecessors, (1178), 0 states have call successors, (0), 0 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-25 15:40:44,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:40:44,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 246 [2022-11-25 15:40:44,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:40:48,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 15:40:50,134 INFO L130 PetriNetUnfolder]: 34/121 cut-off events. [2022-11-25 15:40:50,135 INFO L131 PetriNetUnfolder]: For 514/514 co-relation queries the response was YES. [2022-11-25 15:40:50,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 121 events. 34/121 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 331 event pairs, 18 based on Foata normal form. 3/124 useless extension candidates. Maximal degree in co-relation 579. Up to 91 conditions per place. [2022-11-25 15:40:50,136 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 47 selfloop transitions, 15 changer transitions 0/62 dead transitions. [2022-11-25 15:40:50,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 62 transitions, 558 flow [2022-11-25 15:40:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 15:40:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-25 15:40:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 713 transitions. [2022-11-25 15:40:50,140 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.2229518449030644 [2022-11-25 15:40:50,140 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 713 transitions. [2022-11-25 15:40:50,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 713 transitions. [2022-11-25 15:40:50,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:40:50,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 713 transitions. [2022-11-25 15:40:50,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 54.84615384615385) internal successors, (713), 13 states have internal predecessors, (713), 0 states have call successors, (0), 0 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-25 15:40:50,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 246.0) internal successors, (3444), 14 states have internal predecessors, (3444), 0 states have call successors, (0), 0 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-25 15:40:50,146 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 246.0) internal successors, (3444), 14 states have internal predecessors, (3444), 0 states have call successors, (0), 0 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-25 15:40:50,146 INFO L175 Difference]: Start difference. First operand has 72 places, 39 transitions, 308 flow. Second operand 13 states and 713 transitions. [2022-11-25 15:40:50,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 62 transitions, 558 flow [2022-11-25 15:40:50,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 62 transitions, 504 flow, removed 0 selfloop flow, removed 9 redundant places. [2022-11-25 15:40:50,152 INFO L231 Difference]: Finished difference. Result has 83 places, 51 transitions, 412 flow [2022-11-25 15:40:50,152 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=412, PETRI_PLACES=83, PETRI_TRANSITIONS=51} [2022-11-25 15:40:50,153 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 47 predicate places. [2022-11-25 15:40:50,153 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 51 transitions, 412 flow [2022-11-25 15:40:50,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 53.54545454545455) internal successors, (1178), 22 states have internal predecessors, (1178), 0 states have call successors, (0), 0 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-25 15:40:50,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:40:50,154 INFO L209 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:40:50,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-25 15:40:50,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:40:50,369 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:40:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:40:50,369 INFO L85 PathProgramCache]: Analyzing trace with hash -243413769, now seen corresponding path program 6 times [2022-11-25 15:40:50,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:40:50,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156344933] [2022-11-25 15:40:50,370 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 15:40:50,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:40:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:40:50,371 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:40:50,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-25 15:40:50,626 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-25 15:40:50,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:40:50,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 15:40:50,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:40:50,696 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-25 15:40:50,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2022-11-25 15:40:50,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:50,826 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 15:40:50,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 15:40:50,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 15:40:50,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:51,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:51,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:51,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:51,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:51,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:51,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:40:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:51,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:40:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:40:55,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:40:55,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156344933] [2022-11-25 15:40:55,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156344933] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:40:55,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:40:55,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-25 15:40:55,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609900102] [2022-11-25 15:40:55,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:40:55,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 15:40:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:40:55,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 15:40:55,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=369, Unknown=24, NotChecked=0, Total=462 [2022-11-25 15:40:58,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:00,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:02,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:05,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:07,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:09,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:12,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:14,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:16,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:19,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:21,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:24,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:26,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:29,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:32,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:34,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:37,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:39,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:42,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:44,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:47,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:49,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:41:51,014 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 246 [2022-11-25 15:41:51,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 51 transitions, 412 flow. Second operand has 22 states, 22 states have (on average 54.54545454545455) internal successors, (1200), 22 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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-25 15:41:51,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:41:51,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 246 [2022-11-25 15:41:51,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:42:07,991 WARN L233 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:42:10,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 15:42:12,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 15:42:13,420 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base|))) (let ((.cse1 (not (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse0))) (.cse2 (not (bvult (bvadd (_ bv4 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse0)))) (and (or (forall ((v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_484) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) (not (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| (_ bv1 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse0)) .cse1) (or (forall ((v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_484) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv5 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) .cse2 (not (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| (_ bv5 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse0))) (let ((.cse3 (select |c_#length| c_~v~0.base))) (or (not (bvult (bvadd (_ bv6 32) c_~v~0.offset) .cse3)) (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_478) c_~v~0.base v_ArrVal_484) (_ bv3 32)) (_ bv6 32))) (_ bv0 8)))) (not (bvult (bvadd c_~v~0.offset (_ bv5 32)) .cse3)))) (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_~v~0.base_88 (_ BitVec 32)) (v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_478) v_~v~0.base_88 v_ArrVal_484) (_ bv3 32)) (_ bv6 32))) (_ bv0 8))) (not (= (select |c_#valid| v_~v~0.base_88) (_ bv0 1))))) (or (not (= ((_ extract 7 0) (select (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8))) .cse1) (or (forall ((v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_484) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv4 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) .cse2 (not (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| (_ bv3 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse0)))))) is different from false [2022-11-25 15:42:13,707 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#length| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base|))) (let ((.cse0 (not (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| (_ bv1 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse4))) (.cse3 (not (bvult (bvadd (_ bv2 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse4))) (.cse1 (not (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse4)))) (and (or (forall ((v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_484) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) .cse0 .cse1) (let ((.cse2 (select |c_#length| c_~v~0.base))) (or (not (bvult (bvadd (_ bv6 32) c_~v~0.offset) .cse2)) (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_478) c_~v~0.base v_ArrVal_484) (_ bv3 32)) (_ bv6 32))) (_ bv0 8)))) (not (bvult (bvadd c_~v~0.offset (_ bv5 32)) .cse2)))) (or (forall ((v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_484) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv2 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)))) .cse0 .cse3) (or .cse3 (not (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| (_ bv3 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) .cse4)) (forall ((v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_484) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv3 32) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8))))) (or (not (= ((_ extract 7 0) (select (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8))) .cse1)))) is different from false [2022-11-25 15:42:16,088 INFO L130 PetriNetUnfolder]: 35/132 cut-off events. [2022-11-25 15:42:16,088 INFO L131 PetriNetUnfolder]: For 788/788 co-relation queries the response was YES. [2022-11-25 15:42:16,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 132 events. 35/132 cut-off events. For 788/788 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 370 event pairs, 0 based on Foata normal form. 12/144 useless extension candidates. Maximal degree in co-relation 684. Up to 39 conditions per place. [2022-11-25 15:42:16,089 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 39 selfloop transitions, 41 changer transitions 0/80 dead transitions. [2022-11-25 15:42:16,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 80 transitions, 797 flow [2022-11-25 15:42:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 15:42:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-25 15:42:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1235 transitions. [2022-11-25 15:42:16,092 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.22819660014781967 [2022-11-25 15:42:16,092 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1235 transitions. [2022-11-25 15:42:16,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1235 transitions. [2022-11-25 15:42:16,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:42:16,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1235 transitions. [2022-11-25 15:42:16,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 56.13636363636363) internal successors, (1235), 22 states have internal predecessors, (1235), 0 states have call successors, (0), 0 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-25 15:42:16,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 246.0) internal successors, (5658), 23 states have internal predecessors, (5658), 0 states have call successors, (0), 0 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-25 15:42:16,122 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 246.0) internal successors, (5658), 23 states have internal predecessors, (5658), 0 states have call successors, (0), 0 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-25 15:42:16,122 INFO L175 Difference]: Start difference. First operand has 83 places, 51 transitions, 412 flow. Second operand 22 states and 1235 transitions. [2022-11-25 15:42:16,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 80 transitions, 797 flow [2022-11-25 15:42:16,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 80 transitions, 750 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-11-25 15:42:16,129 INFO L231 Difference]: Finished difference. Result has 104 places, 56 transitions, 562 flow [2022-11-25 15:42:16,130 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=562, PETRI_PLACES=104, PETRI_TRANSITIONS=56} [2022-11-25 15:42:16,130 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 68 predicate places. [2022-11-25 15:42:16,131 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 56 transitions, 562 flow [2022-11-25 15:42:16,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 54.54545454545455) internal successors, (1200), 22 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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-25 15:42:16,131 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:42:16,132 INFO L209 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:16,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:16,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:42:16,334 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:42:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1794365268, now seen corresponding path program 3 times [2022-11-25 15:42:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:16,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351422347] [2022-11-25 15:42:16,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:42:16,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:42:16,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:16,336 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:42:16,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-25 15:42:16,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 15:42:16,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:42:16,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 15:42:16,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:16,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:16,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:16,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:16,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-25 15:42:16,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:16,742 INFO L321 Elim1Store]: treesize reduction 140, result has 25.9 percent of original size [2022-11-25 15:42:16,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 81 [2022-11-25 15:42:16,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:42:17,020 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 15:42:17,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:42:17,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:17,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:17,110 INFO L321 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-25 15:42:17,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 45 [2022-11-25 15:42:17,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:42:18,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:42:18,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:42:18,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:42:18,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:42:18,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:42:18,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:42:18,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-25 15:42:18,616 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-11-25 15:42:18,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 16 [2022-11-25 15:42:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 15:42:18,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:42:18,987 WARN L837 $PredicateComparison]: unable to prove that (forall ((|thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1| (_ BitVec 32)) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_526) |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|) (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| |thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|))) (_ bv0 8)) (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32) |thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) (select |c_#length| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_src#1.base|)) (not (bvult (bvadd |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.offset| |thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) (select |c_#length| |c_thread2Thread1of1ForFork1_#Ultimate.C_strcpy_dest#1.base|))))) is different from false [2022-11-25 15:42:21,197 WARN L837 $PredicateComparison]: unable to prove that (forall ((|thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1| (_ BitVec 32)) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store |c_#memory_int| c_~v~0.base v_ArrVal_526) (_ bv3 32)) |thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|)) (_ bv0 8)) (not (bvult (bvadd c_~v~0.offset |thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) (select |c_#length| c_~v~0.base))) (bvult (bvadd (_ bv1 32) |thread2Thread1of1ForFork1_#Ultimate.C_strcpy_#t~offset14#1|) (select |c_#length| (_ bv3 32))))) is different from false [2022-11-25 15:42:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 14 not checked. [2022-11-25 15:42:23,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:42:23,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351422347] [2022-11-25 15:42:23,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351422347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:42:23,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:42:23,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2022-11-25 15:42:23,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962947876] [2022-11-25 15:42:23,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:42:23,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 15:42:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:42:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 15:42:23,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2022-11-25 15:42:24,236 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 246 [2022-11-25 15:42:24,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 56 transitions, 562 flow. Second operand has 13 states, 13 states have (on average 51.76923076923077) internal successors, (673), 13 states have internal predecessors, (673), 0 states have call successors, (0), 0 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-25 15:42:24,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:42:24,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 246 [2022-11-25 15:42:24,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:42:32,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:42:32,412 INFO L130 PetriNetUnfolder]: 29/108 cut-off events. [2022-11-25 15:42:32,412 INFO L131 PetriNetUnfolder]: For 996/996 co-relation queries the response was YES. [2022-11-25 15:42:32,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 108 events. 29/108 cut-off events. For 996/996 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 244 event pairs, 0 based on Foata normal form. 17/125 useless extension candidates. Maximal degree in co-relation 592. Up to 85 conditions per place. [2022-11-25 15:42:32,413 INFO L137 encePairwiseOnDemand]: 238/246 looper letters, 43 selfloop transitions, 12 changer transitions 0/55 dead transitions. [2022-11-25 15:42:32,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 55 transitions, 617 flow [2022-11-25 15:42:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:42:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:42:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 420 transitions. [2022-11-25 15:42:32,417 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.21341463414634146 [2022-11-25 15:42:32,417 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 420 transitions. [2022-11-25 15:42:32,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 420 transitions. [2022-11-25 15:42:32,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:42:32,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 420 transitions. [2022-11-25 15:42:32,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 52.5) internal successors, (420), 8 states have internal predecessors, (420), 0 states have call successors, (0), 0 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-25 15:42:32,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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-25 15:42:32,420 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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-25 15:42:32,420 INFO L175 Difference]: Start difference. First operand has 104 places, 56 transitions, 562 flow. Second operand 8 states and 420 transitions. [2022-11-25 15:42:32,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 55 transitions, 617 flow [2022-11-25 15:42:32,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 55 transitions, 432 flow, removed 33 selfloop flow, removed 23 redundant places. [2022-11-25 15:42:32,425 INFO L231 Difference]: Finished difference. Result has 86 places, 54 transitions, 346 flow [2022-11-25 15:42:32,425 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=86, PETRI_TRANSITIONS=54} [2022-11-25 15:42:32,426 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 50 predicate places. [2022-11-25 15:42:32,426 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 54 transitions, 346 flow [2022-11-25 15:42:32,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.76923076923077) internal successors, (673), 13 states have internal predecessors, (673), 0 states have call successors, (0), 0 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-25 15:42:32,426 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:42:32,427 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:32,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-11-25 15:42:32,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:42:32,640 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2022-11-25 15:42:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash 518977562, now seen corresponding path program 7 times [2022-11-25 15:42:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:42:32,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235509875] [2022-11-25 15:42:32,640 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 15:42:32,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:42:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:42:32,641 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:42:32,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-25 15:42:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:42:32,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:42:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:42:33,171 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 15:42:33,172 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:42:33,173 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2022-11-25 15:42:33,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2022-11-25 15:42:33,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2022-11-25 15:42:33,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2022-11-25 15:42:33,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2022-11-25 15:42:33,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2022-11-25 15:42:33,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2022-11-25 15:42:33,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2022-11-25 15:42:33,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2022-11-25 15:42:33,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2022-11-25 15:42:33,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2022-11-25 15:42:33,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2022-11-25 15:42:33,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2022-11-25 15:42:33,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2022-11-25 15:42:33,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2022-11-25 15:42:33,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2022-11-25 15:42:33,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2022-11-25 15:42:33,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2022-11-25 15:42:33,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2022-11-25 15:42:33,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2022-11-25 15:42:33,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2022-11-25 15:42:33,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2022-11-25 15:42:33,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2022-11-25 15:42:33,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2022-11-25 15:42:33,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2022-11-25 15:42:33,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2022-11-25 15:42:33,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:33,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:42:33,380 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:33,385 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:42:33,385 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:42:33,395 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,396 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,397 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,397 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,397 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,398 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,398 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,398 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,398 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,399 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,399 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,399 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,400 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,400 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,400 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,400 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,401 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,401 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,401 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,401 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,402 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,402 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,402 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,403 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,403 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,403 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,403 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,404 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,404 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,404 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,405 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,405 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,405 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,405 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,406 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,406 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,406 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,407 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,407 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,407 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,407 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:42:33,408 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:42:33,408 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,408 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,408 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,409 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,409 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:42:33,409 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:42:33,409 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,410 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,410 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2022-11-25 15:42:33,410 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2022-11-25 15:42:33,411 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:42:33,411 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2022-11-25 15:42:33,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:42:33 BasicIcfg [2022-11-25 15:42:33,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:42:33,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:42:33,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:42:33,431 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:42:33,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:35" (3/4) ... [2022-11-25 15:42:33,434 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:42:33,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:42:33,435 INFO L158 Benchmark]: Toolchain (without parser) took 300217.55ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 74.4MB in the beginning and 77.7MB in the end (delta: -3.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-11-25 15:42:33,435 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 69.2MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:42:33,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1167.10ms. Allocated memory is still 98.6MB. Free memory was 74.0MB in the beginning and 66.8MB in the end (delta: 7.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2022-11-25 15:42:33,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.41ms. Allocated memory is still 98.6MB. Free memory was 66.8MB in the beginning and 64.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:42:33,436 INFO L158 Benchmark]: Boogie Preprocessor took 67.86ms. Allocated memory is still 98.6MB. Free memory was 64.3MB in the beginning and 62.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:42:33,436 INFO L158 Benchmark]: RCFGBuilder took 771.00ms. Allocated memory is still 98.6MB. Free memory was 62.3MB in the beginning and 43.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 15:42:33,436 INFO L158 Benchmark]: TraceAbstraction took 298114.58ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 42.9MB in the beginning and 77.7MB in the end (delta: -34.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:42:33,437 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 121.6MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:42:33,438 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 69.2MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1167.10ms. Allocated memory is still 98.6MB. Free memory was 74.0MB in the beginning and 66.8MB in the end (delta: 7.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.41ms. Allocated memory is still 98.6MB. Free memory was 66.8MB in the beginning and 64.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.86ms. Allocated memory is still 98.6MB. Free memory was 64.3MB in the beginning and 62.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 771.00ms. Allocated memory is still 98.6MB. Free memory was 62.3MB in the beginning and 43.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 298114.58ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 42.9MB in the beginning and 77.7MB in the end (delta: -34.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 121.6MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.1s, 115 PlacesBefore, 36 PlacesAfterwards, 113 TransitionsBefore, 31 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 126 TotalNumberOfCompositions, 478 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 441, independent: 424, independent conditional: 0, independent unconditional: 424, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 243, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 243, independent: 229, independent conditional: 0, independent unconditional: 229, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 161, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 441, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 243, unknown conditional: 0, unknown unconditional: 243] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1107. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, pthread_create(&t1, 0, thread1, 0)=127, t1={14:0}, t2={7:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] 0 \read(t1) VAL [\read(t1)=127, \result={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={7:0}, v={4:0}] [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=127, \result={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={7:0}, v={4:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=128, t1={14:0}, t2={7:0}, v={4:0}] [L1116] COND TRUE 2 \read(*v) [L1116] CALL 2 strcpy(v, "Bigshot") [L1125] 0 \read(t2) VAL [\read(t2)=128, \result={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={7:0}, v={4:0}] [L1116] RET 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=128, \result={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={7:0}, v={4:0}] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] EXPR 0 v[0] [L1126] EXPR 0 !v || v[0] == 'B' [L1126] CALL 0 __VERIFIER_assert(!v || v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(!v || v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 0; - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1124]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1122]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 153 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 297.8s, OverallIterations: 26, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 229.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.2s, HoareTripleCheckerStatistics: 304 mSolverCounterUnknown, 4572 SdHoareTripleChecker+Valid, 182.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3626 mSDsluCounter, 2613 SdHoareTripleChecker+Invalid, 177.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 519 IncrementalHoareTripleChecker+Unchecked, 2494 mSDsCounter, 473 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11525 IncrementalHoareTripleChecker+Invalid, 12821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 473 mSolverCounterUnsat, 119 mSDtfsCounter, 11525 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 233 SyntacticMatches, 5 SemanticMatches, 300 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 75.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=562occurred in iteration=24, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 41.1s InterpolantComputationTime, 297 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 418 ConstructedInterpolants, 206 QuantifiedInterpolants, 9213 SizeOfPredicates, 129 NumberOfNonLiveVariables, 2756 ConjunctsInSsa, 414 ConjunctsInUnsatCore, 37 InterpolantComputations, 13 PerfectInterpolantSequences, 59/280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 15:42:33,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41aeee2-38aa-4168-b1d5-33b53df0cf11/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample