./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe028_power.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe028_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 0d78821bc3a287b999f98be361d707254bd2fa61b63b525cf42d392168336d80 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:03:13,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:03:13,784 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:03:13,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:03:13,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:03:13,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:03:13,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:03:13,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:03:13,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:03:13,814 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:03:13,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:03:13,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:03:13,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:03:13,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:03:13,817 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:03:13,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:03:13,818 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:03:13,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:03:13,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:03:13,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:03:13,819 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:03:13,820 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:03:13,820 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:03:13,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:03:13,821 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:03:13,821 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:03:13,822 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:03:13,822 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:03:13,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:03:13,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:03:13,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:03:13,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:03:13,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:03:13,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:03:13,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:03:13,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:03:13,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:03:13,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:03:13,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:03:13,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:03:13,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:03:13,839 INFO L153 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_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0d78821bc3a287b999f98be361d707254bd2fa61b63b525cf42d392168336d80 [2023-11-29 00:03:14,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:03:14,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:03:14,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:03:14,095 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:03:14,096 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:03:14,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe028_power.i [2023-11-29 00:03:16,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:03:17,079 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:03:17,079 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/sv-benchmarks/c/pthread-wmm/safe028_power.i [2023-11-29 00:03:17,099 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/data/71d2df40d/b6a7b51803064b04b7a2966fde767241/FLAGdf96b67e0 [2023-11-29 00:03:17,111 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/data/71d2df40d/b6a7b51803064b04b7a2966fde767241 [2023-11-29 00:03:17,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:03:17,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:03:17,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:03:17,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:03:17,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:03:17,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfc8961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17, skipping insertion in model container [2023-11-29 00:03:17,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,172 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:03:17,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:03:17,510 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:03:17,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:03:17,605 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:03:17,605 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:03:17,611 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:03:17,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17 WrapperNode [2023-11-29 00:03:17,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:03:17,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:03:17,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:03:17,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:03:17,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,666 INFO L138 Inliner]: procedures = 176, calls = 78, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 183 [2023-11-29 00:03:17,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:03:17,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:03:17,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:03:17,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:03:17,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,708 INFO L175 MemorySlicer]: Split 27 memory accesses to 5 slices as follows [22, 2, 1, 1, 1]. 81 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2, 0, 0, 0]. The 10 writes are split as follows [7, 0, 1, 1, 1]. [2023-11-29 00:03:17,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:03:17,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:03:17,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:03:17,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:03:17,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (1/1) ... [2023-11-29 00:03:17,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:03:17,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:17,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:03:17,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:03:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:03:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:03:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:03:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:03:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 00:03:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:03:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:03:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:03:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:03:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:03:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 00:03:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:03:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:03:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:03:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 00:03:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 00:03:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 00:03:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 00:03:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 00:03:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 00:03:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:03:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:03:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:03:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:03:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:03:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 00:03:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:03:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:03:17,826 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:03:18,007 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:03:18,009 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:03:18,520 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:03:19,133 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:03:19,133 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:03:19,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:19 BoogieIcfgContainer [2023-11-29 00:03:19,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:03:19,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:03:19,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:03:19,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:03:19,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:03:17" (1/3) ... [2023-11-29 00:03:19,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35843dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:03:19, skipping insertion in model container [2023-11-29 00:03:19,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:17" (2/3) ... [2023-11-29 00:03:19,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35843dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:03:19, skipping insertion in model container [2023-11-29 00:03:19,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:19" (3/3) ... [2023-11-29 00:03:19,142 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_power.i [2023-11-29 00:03:19,162 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:03:19,162 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2023-11-29 00:03:19,162 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:03:19,332 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:03:19,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 202 flow [2023-11-29 00:03:19,407 INFO L124 PetriNetUnfolderBase]: 2/92 cut-off events. [2023-11-29 00:03:19,407 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:03:19,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 335 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-29 00:03:19,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 202 flow [2023-11-29 00:03:19,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2023-11-29 00:03:19,425 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:03:19,431 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;@1dfea4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:03:19,431 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2023-11-29 00:03:19,434 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:03:19,434 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 00:03:19,434 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:03:19,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:19,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:03:19,435 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:19,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 31362, now seen corresponding path program 1 times [2023-11-29 00:03:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:19,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758147961] [2023-11-29 00:03:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:19,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:19,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758147961] [2023-11-29 00:03:19,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758147961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:19,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:19,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:03:19,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813204696] [2023-11-29 00:03:19,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:19,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:19,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:19,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:19,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2023-11-29 00:03:19,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:19,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:19,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2023-11-29 00:03:19,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:24,312 INFO L124 PetriNetUnfolderBase]: 17186/26464 cut-off events. [2023-11-29 00:03:24,312 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-29 00:03:24,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50609 conditions, 26464 events. 17186/26464 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 2660. Compared 236872 event pairs, 14856 based on Foata normal form. 900/13857 useless extension candidates. Maximal degree in co-relation 50595. Up to 20808 conditions per place. [2023-11-29 00:03:24,531 INFO L140 encePairwiseOnDemand]: 66/95 looper letters, 61 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-11-29 00:03:24,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 85 transitions, 305 flow [2023-11-29 00:03:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:03:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2023-11-29 00:03:24,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6631578947368421 [2023-11-29 00:03:24,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 189 transitions. [2023-11-29 00:03:24,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 189 transitions. [2023-11-29 00:03:24,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:24,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 189 transitions. [2023-11-29 00:03:24,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:24,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:24,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:24,562 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 193 flow. Second operand 3 states and 189 transitions. [2023-11-29 00:03:24,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 85 transitions, 305 flow [2023-11-29 00:03:24,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 85 transitions, 302 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:03:24,573 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 138 flow [2023-11-29 00:03:24,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2023-11-29 00:03:24,579 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -27 predicate places. [2023-11-29 00:03:24,579 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 138 flow [2023-11-29 00:03:24,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:24,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:24,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:03:24,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:03:24,580 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:24,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash 31363, now seen corresponding path program 1 times [2023-11-29 00:03:24,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:24,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391153304] [2023-11-29 00:03:24,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:24,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:24,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:24,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391153304] [2023-11-29 00:03:24,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391153304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:24,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:24,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:03:24,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621605932] [2023-11-29 00:03:24,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:24,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:24,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:24,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:24,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 95 [2023-11-29 00:03:24,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:24,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:24,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 95 [2023-11-29 00:03:24,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:29,106 INFO L124 PetriNetUnfolderBase]: 17186/26463 cut-off events. [2023-11-29 00:03:29,106 INFO L125 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2023-11-29 00:03:29,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51056 conditions, 26463 events. 17186/26463 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 2660. Compared 237185 event pairs, 14856 based on Foata normal form. 1/12957 useless extension candidates. Maximal degree in co-relation 51045. Up to 20807 conditions per place. [2023-11-29 00:03:29,281 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 60 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-11-29 00:03:29,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 302 flow [2023-11-29 00:03:29,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:03:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 00:03:29,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2023-11-29 00:03:29,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 00:03:29,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 00:03:29,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:29,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 00:03:29,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:29,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:29,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:29,289 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 138 flow. Second operand 3 states and 141 transitions. [2023-11-29 00:03:29,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 302 flow [2023-11-29 00:03:29,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:03:29,391 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 136 flow [2023-11-29 00:03:29,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2023-11-29 00:03:29,392 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2023-11-29 00:03:29,393 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 136 flow [2023-11-29 00:03:29,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:29,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:29,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:03:29,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:03:29,394 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:29,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash 935305323, now seen corresponding path program 1 times [2023-11-29 00:03:29,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672507201] [2023-11-29 00:03:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:29,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:29,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:29,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672507201] [2023-11-29 00:03:29,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672507201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:29,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:29,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:03:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477969539] [2023-11-29 00:03:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:29,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:29,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:29,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:29,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:29,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2023-11-29 00:03:29,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:29,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:29,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2023-11-29 00:03:29,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:32,587 INFO L124 PetriNetUnfolderBase]: 17190/26370 cut-off events. [2023-11-29 00:03:32,587 INFO L125 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2023-11-29 00:03:32,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50972 conditions, 26370 events. 17190/26370 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 2660. Compared 235025 event pairs, 14946 based on Foata normal form. 0/12870 useless extension candidates. Maximal degree in co-relation 50961. Up to 20810 conditions per place. [2023-11-29 00:03:32,717 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 61 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-11-29 00:03:32,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 83 transitions, 302 flow [2023-11-29 00:03:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:03:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2023-11-29 00:03:32,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48771929824561405 [2023-11-29 00:03:32,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 139 transitions. [2023-11-29 00:03:32,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 139 transitions. [2023-11-29 00:03:32,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:32,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 139 transitions. [2023-11-29 00:03:32,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:32,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:32,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:32,722 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 136 flow. Second operand 3 states and 139 transitions. [2023-11-29 00:03:32,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 83 transitions, 302 flow [2023-11-29 00:03:32,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:03:32,761 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 134 flow [2023-11-29 00:03:32,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-29 00:03:32,762 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -29 predicate places. [2023-11-29 00:03:32,762 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 134 flow [2023-11-29 00:03:32,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:32,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:32,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:03:32,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:03:32,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:32,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash 935305324, now seen corresponding path program 1 times [2023-11-29 00:03:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113411265] [2023-11-29 00:03:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:32,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:32,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113411265] [2023-11-29 00:03:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113411265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:32,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:03:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123830526] [2023-11-29 00:03:32,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:32,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:32,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:32,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:32,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 95 [2023-11-29 00:03:32,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:32,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:32,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 95 [2023-11-29 00:03:32,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:36,695 INFO L124 PetriNetUnfolderBase]: 17186/26361 cut-off events. [2023-11-29 00:03:36,695 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES. [2023-11-29 00:03:36,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50958 conditions, 26361 events. 17186/26361 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 2660. Compared 235000 event pairs, 14942 based on Foata normal form. 5/12870 useless extension candidates. Maximal degree in co-relation 50948. Up to 20801 conditions per place. [2023-11-29 00:03:36,843 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 60 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-11-29 00:03:36,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 298 flow [2023-11-29 00:03:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:03:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 00:03:36,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2023-11-29 00:03:36,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 00:03:36,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 00:03:36,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:36,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 00:03:36,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:36,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:36,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:36,848 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 134 flow. Second operand 3 states and 141 transitions. [2023-11-29 00:03:36,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 298 flow [2023-11-29 00:03:36,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 82 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:03:36,884 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 132 flow [2023-11-29 00:03:36,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 00:03:36,885 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -30 predicate places. [2023-11-29 00:03:36,885 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 132 flow [2023-11-29 00:03:36,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:36,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:36,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:36,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:03:36,886 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:36,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1182348274, now seen corresponding path program 1 times [2023-11-29 00:03:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:36,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130422808] [2023-11-29 00:03:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:36,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:36,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130422808] [2023-11-29 00:03:36,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130422808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:36,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:03:36,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171324370] [2023-11-29 00:03:36,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:36,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:03:36,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:03:36,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:03:36,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 95 [2023-11-29 00:03:36,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:36,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:36,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 95 [2023-11-29 00:03:36,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:38,768 INFO L124 PetriNetUnfolderBase]: 8251/13534 cut-off events. [2023-11-29 00:03:38,768 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2023-11-29 00:03:38,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25866 conditions, 13534 events. 8251/13534 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 117092 event pairs, 5610 based on Foata normal form. 0/8245 useless extension candidates. Maximal degree in co-relation 25855. Up to 7436 conditions per place. [2023-11-29 00:03:38,854 INFO L140 encePairwiseOnDemand]: 81/95 looper letters, 65 selfloop transitions, 6 changer transitions 0/90 dead transitions. [2023-11-29 00:03:38,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 90 transitions, 332 flow [2023-11-29 00:03:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:03:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:03:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2023-11-29 00:03:38,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49736842105263157 [2023-11-29 00:03:38,857 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 189 transitions. [2023-11-29 00:03:38,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 189 transitions. [2023-11-29 00:03:38,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:38,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 189 transitions. [2023-11-29 00:03:38,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:38,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:38,859 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:38,859 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 132 flow. Second operand 4 states and 189 transitions. [2023-11-29 00:03:38,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 90 transitions, 332 flow [2023-11-29 00:03:38,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:03:38,865 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 188 flow [2023-11-29 00:03:38,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2023-11-29 00:03:38,866 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2023-11-29 00:03:38,866 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 188 flow [2023-11-29 00:03:38,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:38,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:38,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:38,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:03:38,867 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:38,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1182348275, now seen corresponding path program 1 times [2023-11-29 00:03:38,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:38,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924562774] [2023-11-29 00:03:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:38,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:38,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924562774] [2023-11-29 00:03:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924562774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:38,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:38,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:03:38,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593178606] [2023-11-29 00:03:38,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:38,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:38,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:38,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:38,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:03:38,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:38,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:38,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:03:38,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:39,691 INFO L124 PetriNetUnfolderBase]: 2340/4197 cut-off events. [2023-11-29 00:03:39,691 INFO L125 PetriNetUnfolderBase]: For 1614/1632 co-relation queries the response was YES. [2023-11-29 00:03:39,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10037 conditions, 4197 events. 2340/4197 cut-off events. For 1614/1632 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 33081 event pairs, 2150 based on Foata normal form. 1007/4685 useless extension candidates. Maximal degree in co-relation 10023. Up to 3621 conditions per place. [2023-11-29 00:03:39,708 INFO L140 encePairwiseOnDemand]: 86/95 looper letters, 34 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-11-29 00:03:39,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 242 flow [2023-11-29 00:03:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:03:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 00:03:39,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2023-11-29 00:03:39,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 00:03:39,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 00:03:39,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:39,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 00:03:39,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:39,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:39,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:39,712 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 188 flow. Second operand 3 states and 120 transitions. [2023-11-29 00:03:39,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 242 flow [2023-11-29 00:03:39,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 55 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:03:39,716 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 172 flow [2023-11-29 00:03:39,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2023-11-29 00:03:39,716 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -35 predicate places. [2023-11-29 00:03:39,717 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 172 flow [2023-11-29 00:03:39,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:39,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:39,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:39,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:03:39,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:39,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:39,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2065933610, now seen corresponding path program 1 times [2023-11-29 00:03:39,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:39,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956157865] [2023-11-29 00:03:39,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:39,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:39,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956157865] [2023-11-29 00:03:39,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956157865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:39,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:39,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:03:39,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7130137] [2023-11-29 00:03:39,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:39,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:39,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:39,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:39,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:39,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 95 [2023-11-29 00:03:39,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:39,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:39,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 95 [2023-11-29 00:03:39,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:40,474 INFO L124 PetriNetUnfolderBase]: 2340/4199 cut-off events. [2023-11-29 00:03:40,474 INFO L125 PetriNetUnfolderBase]: For 1496/1504 co-relation queries the response was YES. [2023-11-29 00:03:40,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10040 conditions, 4199 events. 2340/4199 cut-off events. For 1496/1504 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 33033 event pairs, 1280 based on Foata normal form. 15/3692 useless extension candidates. Maximal degree in co-relation 10030. Up to 1893 conditions per place. [2023-11-29 00:03:40,494 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 42 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 00:03:40,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 284 flow [2023-11-29 00:03:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:03:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 00:03:40,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41754385964912283 [2023-11-29 00:03:40,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 00:03:40,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 00:03:40,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:40,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 00:03:40,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:40,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:40,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:40,498 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 172 flow. Second operand 3 states and 119 transitions. [2023-11-29 00:03:40,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 284 flow [2023-11-29 00:03:40,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:03:40,501 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 173 flow [2023-11-29 00:03:40,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 00:03:40,502 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -35 predicate places. [2023-11-29 00:03:40,502 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 173 flow [2023-11-29 00:03:40,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:40,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:40,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:40,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:03:40,502 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:40,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2065933611, now seen corresponding path program 1 times [2023-11-29 00:03:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:40,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571541330] [2023-11-29 00:03:40,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:40,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:40,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571541330] [2023-11-29 00:03:40,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571541330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:40,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:40,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:03:40,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434577426] [2023-11-29 00:03:40,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:40,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:40,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:40,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:40,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:40,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2023-11-29 00:03:40,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:40,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:40,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2023-11-29 00:03:40,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:41,198 INFO L124 PetriNetUnfolderBase]: 2362/4206 cut-off events. [2023-11-29 00:03:41,198 INFO L125 PetriNetUnfolderBase]: For 1636/1644 co-relation queries the response was YES. [2023-11-29 00:03:41,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10167 conditions, 4206 events. 2362/4206 cut-off events. For 1636/1644 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 32996 event pairs, 1280 based on Foata normal form. 0/3696 useless extension candidates. Maximal degree in co-relation 10157. Up to 1893 conditions per place. [2023-11-29 00:03:41,216 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 43 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 00:03:41,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 287 flow [2023-11-29 00:03:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:03:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 00:03:41,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105263157894737 [2023-11-29 00:03:41,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 00:03:41,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 00:03:41,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:41,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 00:03:41,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:41,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:41,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:41,219 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 173 flow. Second operand 3 states and 117 transitions. [2023-11-29 00:03:41,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 287 flow [2023-11-29 00:03:41,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:03:41,222 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 171 flow [2023-11-29 00:03:41,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-29 00:03:41,222 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2023-11-29 00:03:41,222 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 171 flow [2023-11-29 00:03:41,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:41,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:41,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:41,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:03:41,223 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:41,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:41,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2065932372, now seen corresponding path program 1 times [2023-11-29 00:03:41,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:41,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109187536] [2023-11-29 00:03:41,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:41,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109187536] [2023-11-29 00:03:41,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109187536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:41,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:41,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:03:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504634183] [2023-11-29 00:03:41,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:41,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:41,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:41,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:03:41,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:41,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:41,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:03:41,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:41,998 INFO L124 PetriNetUnfolderBase]: 1891/3328 cut-off events. [2023-11-29 00:03:41,999 INFO L125 PetriNetUnfolderBase]: For 1158/1158 co-relation queries the response was YES. [2023-11-29 00:03:42,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8294 conditions, 3328 events. 1891/3328 cut-off events. For 1158/1158 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 25368 event pairs, 326 based on Foata normal form. 0/3112 useless extension candidates. Maximal degree in co-relation 8284. Up to 2502 conditions per place. [2023-11-29 00:03:42,017 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 56 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-29 00:03:42,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 376 flow [2023-11-29 00:03:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:03:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2023-11-29 00:03:42,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-11-29 00:03:42,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2023-11-29 00:03:42,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2023-11-29 00:03:42,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:42,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2023-11-29 00:03:42,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:42,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:42,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:42,021 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 171 flow. Second operand 3 states and 133 transitions. [2023-11-29 00:03:42,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 376 flow [2023-11-29 00:03:42,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:03:42,024 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 169 flow [2023-11-29 00:03:42,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 00:03:42,025 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2023-11-29 00:03:42,025 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 169 flow [2023-11-29 00:03:42,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:42,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:42,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:42,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:03:42,026 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:42,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1487499559, now seen corresponding path program 1 times [2023-11-29 00:03:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250734486] [2023-11-29 00:03:42,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:42,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:42,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250734486] [2023-11-29 00:03:42,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250734486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:42,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:42,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:03:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305014697] [2023-11-29 00:03:42,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:42,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:42,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:42,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:42,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:42,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:03:42,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:42,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:42,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:03:42,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:42,695 INFO L124 PetriNetUnfolderBase]: 1833/3337 cut-off events. [2023-11-29 00:03:42,695 INFO L125 PetriNetUnfolderBase]: For 1412/1421 co-relation queries the response was YES. [2023-11-29 00:03:42,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8328 conditions, 3337 events. 1833/3337 cut-off events. For 1412/1421 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 25236 event pairs, 654 based on Foata normal form. 0/3136 useless extension candidates. Maximal degree in co-relation 8317. Up to 2264 conditions per place. [2023-11-29 00:03:42,708 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 49 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-11-29 00:03:42,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 338 flow [2023-11-29 00:03:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:03:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-11-29 00:03:42,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2023-11-29 00:03:42,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-11-29 00:03:42,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-11-29 00:03:42,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:42,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-11-29 00:03:42,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:42,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:42,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:42,712 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 169 flow. Second operand 3 states and 129 transitions. [2023-11-29 00:03:42,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 338 flow [2023-11-29 00:03:42,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:03:42,715 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 178 flow [2023-11-29 00:03:42,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-29 00:03:42,716 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2023-11-29 00:03:42,716 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 178 flow [2023-11-29 00:03:42,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:42,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:42,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:42,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:03:42,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:42,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash -736924554, now seen corresponding path program 1 times [2023-11-29 00:03:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990751251] [2023-11-29 00:03:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:42,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:42,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990751251] [2023-11-29 00:03:42,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990751251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:42,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:03:42,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761518883] [2023-11-29 00:03:42,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:42,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:03:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:42,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:03:42,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:03:42,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:03:42,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:42,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:42,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:03:42,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:43,462 INFO L124 PetriNetUnfolderBase]: 1902/3602 cut-off events. [2023-11-29 00:03:43,462 INFO L125 PetriNetUnfolderBase]: For 1473/1482 co-relation queries the response was YES. [2023-11-29 00:03:43,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8962 conditions, 3602 events. 1902/3602 cut-off events. For 1473/1482 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 28480 event pairs, 546 based on Foata normal form. 0/3481 useless extension candidates. Maximal degree in co-relation 8950. Up to 1328 conditions per place. [2023-11-29 00:03:43,477 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 45 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2023-11-29 00:03:43,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 71 transitions, 329 flow [2023-11-29 00:03:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:03:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:03:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2023-11-29 00:03:43,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4263157894736842 [2023-11-29 00:03:43,478 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 162 transitions. [2023-11-29 00:03:43,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 162 transitions. [2023-11-29 00:03:43,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:43,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 162 transitions. [2023-11-29 00:03:43,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:43,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:43,481 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:43,481 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 178 flow. Second operand 4 states and 162 transitions. [2023-11-29 00:03:43,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 71 transitions, 329 flow [2023-11-29 00:03:43,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:03:43,483 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 189 flow [2023-11-29 00:03:43,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-29 00:03:43,484 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2023-11-29 00:03:43,484 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 189 flow [2023-11-29 00:03:43,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:43,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:43,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:43,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:03:43,484 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:43,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash -736924553, now seen corresponding path program 1 times [2023-11-29 00:03:43,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:43,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060986626] [2023-11-29 00:03:43,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:43,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:43,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060986626] [2023-11-29 00:03:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060986626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:43,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:43,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:03:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031308621] [2023-11-29 00:03:43,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:43,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:03:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:43,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:03:43,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:03:43,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:03:43,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:43,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:43,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:03:43,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:44,223 INFO L124 PetriNetUnfolderBase]: 1827/3475 cut-off events. [2023-11-29 00:03:44,223 INFO L125 PetriNetUnfolderBase]: For 1916/1925 co-relation queries the response was YES. [2023-11-29 00:03:44,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8891 conditions, 3475 events. 1827/3475 cut-off events. For 1916/1925 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 27546 event pairs, 622 based on Foata normal form. 36/3390 useless extension candidates. Maximal degree in co-relation 8879. Up to 2313 conditions per place. [2023-11-29 00:03:44,237 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 47 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2023-11-29 00:03:44,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 347 flow [2023-11-29 00:03:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:03:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:03:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2023-11-29 00:03:44,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026315789473684 [2023-11-29 00:03:44,238 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 153 transitions. [2023-11-29 00:03:44,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 153 transitions. [2023-11-29 00:03:44,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:44,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 153 transitions. [2023-11-29 00:03:44,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:44,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:44,240 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:44,240 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 189 flow. Second operand 4 states and 153 transitions. [2023-11-29 00:03:44,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 347 flow [2023-11-29 00:03:44,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 68 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:03:44,242 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 181 flow [2023-11-29 00:03:44,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-11-29 00:03:44,243 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2023-11-29 00:03:44,243 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 181 flow [2023-11-29 00:03:44,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:44,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:44,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:44,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:03:44,244 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:44,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:44,244 INFO L85 PathProgramCache]: Analyzing trace with hash 411796245, now seen corresponding path program 1 times [2023-11-29 00:03:44,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:44,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780467858] [2023-11-29 00:03:44,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:44,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:44,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:44,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780467858] [2023-11-29 00:03:44,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780467858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:44,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:44,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:03:44,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866574194] [2023-11-29 00:03:44,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:44,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:03:44,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:44,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:03:44,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:03:44,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 95 [2023-11-29 00:03:44,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 181 flow. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:44,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:44,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 95 [2023-11-29 00:03:44,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:45,538 INFO L124 PetriNetUnfolderBase]: 1829/3395 cut-off events. [2023-11-29 00:03:45,538 INFO L125 PetriNetUnfolderBase]: For 1793/1793 co-relation queries the response was YES. [2023-11-29 00:03:45,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8770 conditions, 3395 events. 1829/3395 cut-off events. For 1793/1793 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 25908 event pairs, 483 based on Foata normal form. 0/3277 useless extension candidates. Maximal degree in co-relation 8758. Up to 1844 conditions per place. [2023-11-29 00:03:45,551 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 55 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2023-11-29 00:03:45,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 375 flow [2023-11-29 00:03:45,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:03:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:03:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2023-11-29 00:03:45,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.318796992481203 [2023-11-29 00:03:45,553 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 212 transitions. [2023-11-29 00:03:45,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 212 transitions. [2023-11-29 00:03:45,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:45,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 212 transitions. [2023-11-29 00:03:45,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.285714285714285) internal successors, (212), 7 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:45,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 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) [2023-11-29 00:03:45,555 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 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) [2023-11-29 00:03:45,555 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 181 flow. Second operand 7 states and 212 transitions. [2023-11-29 00:03:45,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 375 flow [2023-11-29 00:03:45,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:03:45,557 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 199 flow [2023-11-29 00:03:45,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=199, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2023-11-29 00:03:45,557 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -32 predicate places. [2023-11-29 00:03:45,558 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 199 flow [2023-11-29 00:03:45,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:45,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:45,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:45,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:03:45,558 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:45,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash 411795057, now seen corresponding path program 1 times [2023-11-29 00:03:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718097786] [2023-11-29 00:03:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:45,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:45,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718097786] [2023-11-29 00:03:45,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718097786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:45,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:45,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:03:45,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64070915] [2023-11-29 00:03:45,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:45,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:03:45,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:45,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:03:45,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:03:45,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 95 [2023-11-29 00:03:45,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:45,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:45,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 95 [2023-11-29 00:03:45,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:46,474 INFO L124 PetriNetUnfolderBase]: 2952/4878 cut-off events. [2023-11-29 00:03:46,474 INFO L125 PetriNetUnfolderBase]: For 2611/2623 co-relation queries the response was YES. [2023-11-29 00:03:46,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12255 conditions, 4878 events. 2952/4878 cut-off events. For 2611/2623 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32578 event pairs, 532 based on Foata normal form. 100/4878 useless extension candidates. Maximal degree in co-relation 12242. Up to 3621 conditions per place. [2023-11-29 00:03:46,495 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 56 selfloop transitions, 5 changer transitions 2/76 dead transitions. [2023-11-29 00:03:46,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 76 transitions, 412 flow [2023-11-29 00:03:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:03:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:03:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-11-29 00:03:46,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3973684210526316 [2023-11-29 00:03:46,497 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 151 transitions. [2023-11-29 00:03:46,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 151 transitions. [2023-11-29 00:03:46,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:46,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 151 transitions. [2023-11-29 00:03:46,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:46,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:46,500 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:46,500 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 199 flow. Second operand 4 states and 151 transitions. [2023-11-29 00:03:46,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 76 transitions, 412 flow [2023-11-29 00:03:46,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 398 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:03:46,504 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 216 flow [2023-11-29 00:03:46,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2023-11-29 00:03:46,505 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -31 predicate places. [2023-11-29 00:03:46,505 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 216 flow [2023-11-29 00:03:46,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:46,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:46,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:46,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:03:46,505 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:46,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash -516574270, now seen corresponding path program 1 times [2023-11-29 00:03:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:46,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747795046] [2023-11-29 00:03:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:46,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747795046] [2023-11-29 00:03:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747795046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:46,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:03:46,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557835957] [2023-11-29 00:03:46,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:46,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:03:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:46,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:03:46,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:03:46,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 95 [2023-11-29 00:03:46,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:46,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:46,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 95 [2023-11-29 00:03:46,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:47,184 INFO L124 PetriNetUnfolderBase]: 1352/2276 cut-off events. [2023-11-29 00:03:47,185 INFO L125 PetriNetUnfolderBase]: For 1476/1488 co-relation queries the response was YES. [2023-11-29 00:03:47,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6004 conditions, 2276 events. 1352/2276 cut-off events. For 1476/1488 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12755 event pairs, 158 based on Foata normal form. 82/2326 useless extension candidates. Maximal degree in co-relation 5989. Up to 1213 conditions per place. [2023-11-29 00:03:47,193 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 63 selfloop transitions, 8 changer transitions 5/89 dead transitions. [2023-11-29 00:03:47,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 89 transitions, 504 flow [2023-11-29 00:03:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:03:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:03:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2023-11-29 00:03:47,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3957894736842105 [2023-11-29 00:03:47,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 188 transitions. [2023-11-29 00:03:47,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 188 transitions. [2023-11-29 00:03:47,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:47,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 188 transitions. [2023-11-29 00:03:47,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:47,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:47,196 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:47,196 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 216 flow. Second operand 5 states and 188 transitions. [2023-11-29 00:03:47,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 89 transitions, 504 flow [2023-11-29 00:03:47,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 469 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 00:03:47,199 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 214 flow [2023-11-29 00:03:47,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2023-11-29 00:03:47,199 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -29 predicate places. [2023-11-29 00:03:47,199 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 214 flow [2023-11-29 00:03:47,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:47,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:47,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:47,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:03:47,200 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:47,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash 709174634, now seen corresponding path program 1 times [2023-11-29 00:03:47,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:47,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359683146] [2023-11-29 00:03:47,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:47,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359683146] [2023-11-29 00:03:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359683146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:03:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477419770] [2023-11-29 00:03:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:47,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:03:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:03:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:03:47,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 95 [2023-11-29 00:03:47,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:47,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:47,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 95 [2023-11-29 00:03:47,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:47,786 INFO L124 PetriNetUnfolderBase]: 603/1001 cut-off events. [2023-11-29 00:03:47,786 INFO L125 PetriNetUnfolderBase]: For 1065/1077 co-relation queries the response was YES. [2023-11-29 00:03:47,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2912 conditions, 1001 events. 603/1001 cut-off events. For 1065/1077 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4501 event pairs, 81 based on Foata normal form. 40/1025 useless extension candidates. Maximal degree in co-relation 2903. Up to 308 conditions per place. [2023-11-29 00:03:47,790 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 47 selfloop transitions, 11 changer transitions 3/74 dead transitions. [2023-11-29 00:03:47,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 74 transitions, 393 flow [2023-11-29 00:03:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:03:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:03:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2023-11-29 00:03:47,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3526315789473684 [2023-11-29 00:03:47,791 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 201 transitions. [2023-11-29 00:03:47,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 201 transitions. [2023-11-29 00:03:47,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:47,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 201 transitions. [2023-11-29 00:03:47,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:47,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:47,793 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:47,793 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 214 flow. Second operand 6 states and 201 transitions. [2023-11-29 00:03:47,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 74 transitions, 393 flow [2023-11-29 00:03:47,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 354 flow, removed 4 selfloop flow, removed 8 redundant places. [2023-11-29 00:03:47,797 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 179 flow [2023-11-29 00:03:47,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-11-29 00:03:47,798 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2023-11-29 00:03:47,798 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 179 flow [2023-11-29 00:03:47,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:47,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:47,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:47,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:03:47,799 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:47,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 563005209, now seen corresponding path program 1 times [2023-11-29 00:03:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:47,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140538487] [2023-11-29 00:03:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:48,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:48,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140538487] [2023-11-29 00:03:48,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140538487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:48,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:48,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:03:48,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037393382] [2023-11-29 00:03:48,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:48,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:03:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:03:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:03:48,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2023-11-29 00:03:48,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:48,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:48,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2023-11-29 00:03:48,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:48,464 INFO L124 PetriNetUnfolderBase]: 685/1336 cut-off events. [2023-11-29 00:03:48,464 INFO L125 PetriNetUnfolderBase]: For 772/789 co-relation queries the response was YES. [2023-11-29 00:03:48,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3298 conditions, 1336 events. 685/1336 cut-off events. For 772/789 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7525 event pairs, 142 based on Foata normal form. 8/1301 useless extension candidates. Maximal degree in co-relation 3290. Up to 583 conditions per place. [2023-11-29 00:03:48,468 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 27 selfloop transitions, 1 changer transitions 24/73 dead transitions. [2023-11-29 00:03:48,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 368 flow [2023-11-29 00:03:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:03:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:03:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2023-11-29 00:03:48,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.356140350877193 [2023-11-29 00:03:48,470 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 203 transitions. [2023-11-29 00:03:48,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 203 transitions. [2023-11-29 00:03:48,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:48,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 203 transitions. [2023-11-29 00:03:48,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:48,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:48,472 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:48,473 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 179 flow. Second operand 6 states and 203 transitions. [2023-11-29 00:03:48,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 368 flow [2023-11-29 00:03:48,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 304 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-29 00:03:48,476 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 134 flow [2023-11-29 00:03:48,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2023-11-29 00:03:48,477 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -39 predicate places. [2023-11-29 00:03:48,477 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 134 flow [2023-11-29 00:03:48,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:48,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:48,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:48,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:03:48,477 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:48,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1465830447, now seen corresponding path program 2 times [2023-11-29 00:03:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:48,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978688259] [2023-11-29 00:03:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:48,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978688259] [2023-11-29 00:03:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978688259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:03:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437917439] [2023-11-29 00:03:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:51,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:03:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:03:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:03:51,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:03:51,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 134 flow. Second operand has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:51,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:51,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:03:51,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:52,339 INFO L124 PetriNetUnfolderBase]: 922/1853 cut-off events. [2023-11-29 00:03:52,339 INFO L125 PetriNetUnfolderBase]: For 167/211 co-relation queries the response was YES. [2023-11-29 00:03:52,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 1853 events. 922/1853 cut-off events. For 167/211 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11778 event pairs, 184 based on Foata normal form. 16/1790 useless extension candidates. Maximal degree in co-relation 3989. Up to 335 conditions per place. [2023-11-29 00:03:52,346 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 56 selfloop transitions, 13 changer transitions 28/120 dead transitions. [2023-11-29 00:03:52,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 120 transitions, 539 flow [2023-11-29 00:03:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:03:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 00:03:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 477 transitions. [2023-11-29 00:03:52,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3586466165413534 [2023-11-29 00:03:52,349 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 477 transitions. [2023-11-29 00:03:52,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 477 transitions. [2023-11-29 00:03:52,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:52,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 477 transitions. [2023-11-29 00:03:52,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 34.07142857142857) internal successors, (477), 14 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:52,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 95.0) internal successors, (1425), 15 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:52,354 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 95.0) internal successors, (1425), 15 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:52,354 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 134 flow. Second operand 14 states and 477 transitions. [2023-11-29 00:03:52,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 120 transitions, 539 flow [2023-11-29 00:03:52,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 120 transitions, 518 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-29 00:03:52,357 INFO L231 Difference]: Finished difference. Result has 77 places, 54 transitions, 244 flow [2023-11-29 00:03:52,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=244, PETRI_PLACES=77, PETRI_TRANSITIONS=54} [2023-11-29 00:03:52,357 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -23 predicate places. [2023-11-29 00:03:52,357 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 54 transitions, 244 flow [2023-11-29 00:03:52,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:52,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:52,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:52,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:03:52,358 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:03:52,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1538037531, now seen corresponding path program 3 times [2023-11-29 00:03:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:52,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930234768] [2023-11-29 00:03:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:52,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:52,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:52,542 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:03:52,543 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining) [2023-11-29 00:03:52,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining) [2023-11-29 00:03:52,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining) [2023-11-29 00:03:52,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining) [2023-11-29 00:03:52,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining) [2023-11-29 00:03:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining) [2023-11-29 00:03:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining) [2023-11-29 00:03:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining) [2023-11-29 00:03:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining) [2023-11-29 00:03:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining) [2023-11-29 00:03:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining) [2023-11-29 00:03:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining) [2023-11-29 00:03:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining) [2023-11-29 00:03:52,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining) [2023-11-29 00:03:52,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining) [2023-11-29 00:03:52,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining) [2023-11-29 00:03:52,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining) [2023-11-29 00:03:52,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining) [2023-11-29 00:03:52,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining) [2023-11-29 00:03:52,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining) [2023-11-29 00:03:52,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining) [2023-11-29 00:03:52,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining) [2023-11-29 00:03:52,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining) [2023-11-29 00:03:52,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining) [2023-11-29 00:03:52,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining) [2023-11-29 00:03:52,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining) [2023-11-29 00:03:52,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining) [2023-11-29 00:03:52,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining) [2023-11-29 00:03:52,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining) [2023-11-29 00:03:52,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining) [2023-11-29 00:03:52,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining) [2023-11-29 00:03:52,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining) [2023-11-29 00:03:52,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining) [2023-11-29 00:03:52,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining) [2023-11-29 00:03:52,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining) [2023-11-29 00:03:52,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining) [2023-11-29 00:03:52,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining) [2023-11-29 00:03:52,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining) [2023-11-29 00:03:52,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining) [2023-11-29 00:03:52,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining) [2023-11-29 00:03:52,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining) [2023-11-29 00:03:52,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining) [2023-11-29 00:03:52,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining) [2023-11-29 00:03:52,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining) [2023-11-29 00:03:52,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining) [2023-11-29 00:03:52,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining) [2023-11-29 00:03:52,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining) [2023-11-29 00:03:52,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining) [2023-11-29 00:03:52,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining) [2023-11-29 00:03:52,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining) [2023-11-29 00:03:52,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining) [2023-11-29 00:03:52,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining) [2023-11-29 00:03:52,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining) [2023-11-29 00:03:52,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining) [2023-11-29 00:03:52,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining) [2023-11-29 00:03:52,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining) [2023-11-29 00:03:52,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining) [2023-11-29 00:03:52,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining) [2023-11-29 00:03:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining) [2023-11-29 00:03:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining) [2023-11-29 00:03:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining) [2023-11-29 00:03:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining) [2023-11-29 00:03:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining) [2023-11-29 00:03:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining) [2023-11-29 00:03:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining) [2023-11-29 00:03:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining) [2023-11-29 00:03:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining) [2023-11-29 00:03:52,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining) [2023-11-29 00:03:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining) [2023-11-29 00:03:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining) [2023-11-29 00:03:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining) [2023-11-29 00:03:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining) [2023-11-29 00:03:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining) [2023-11-29 00:03:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining) [2023-11-29 00:03:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining) [2023-11-29 00:03:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining) [2023-11-29 00:03:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining) [2023-11-29 00:03:52,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining) [2023-11-29 00:03:52,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining) [2023-11-29 00:03:52,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining) [2023-11-29 00:03:52,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining) [2023-11-29 00:03:52,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining) [2023-11-29 00:03:52,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining) [2023-11-29 00:03:52,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining) [2023-11-29 00:03:52,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining) [2023-11-29 00:03:52,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining) [2023-11-29 00:03:52,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining) [2023-11-29 00:03:52,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining) [2023-11-29 00:03:52,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining) [2023-11-29 00:03:52,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining) [2023-11-29 00:03:52,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining) [2023-11-29 00:03:52,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:03:52,554 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:52,560 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:03:52,560 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:03:52,617 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated [2023-11-29 00:03:52,619 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated [2023-11-29 00:03:52,620 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre37 could not be translated [2023-11-29 00:03:52,633 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:03:52,635 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:03:52,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:03:52 BasicIcfg [2023-11-29 00:03:52,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:03:52,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:03:52,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:03:52,651 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:03:52,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:19" (3/4) ... [2023-11-29 00:03:52,652 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:03:52,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:03:52,654 INFO L158 Benchmark]: Toolchain (without parser) took 35538.50ms. Allocated memory was 136.3MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 89.7MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2023-11-29 00:03:52,654 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory was 105.6MB in the beginning and 105.4MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:03:52,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.03ms. Allocated memory is still 136.3MB. Free memory was 89.2MB in the beginning and 63.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 00:03:52,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.67ms. Allocated memory is still 136.3MB. Free memory was 63.8MB in the beginning and 61.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:03:52,655 INFO L158 Benchmark]: Boogie Preprocessor took 72.88ms. Allocated memory is still 136.3MB. Free memory was 61.3MB in the beginning and 56.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:03:52,656 INFO L158 Benchmark]: RCFGBuilder took 1392.51ms. Allocated memory was 136.3MB in the beginning and 199.2MB in the end (delta: 62.9MB). Free memory was 56.2MB in the beginning and 74.1MB in the end (delta: -17.8MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2023-11-29 00:03:52,656 INFO L158 Benchmark]: TraceAbstraction took 33514.33ms. Allocated memory was 199.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 73.0MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-11-29 00:03:52,656 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 4.2GB. Free memory is still 1.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:03:52,658 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory was 105.6MB in the beginning and 105.4MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.03ms. Allocated memory is still 136.3MB. Free memory was 89.2MB in the beginning and 63.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.67ms. Allocated memory is still 136.3MB. Free memory was 63.8MB in the beginning and 61.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.88ms. Allocated memory is still 136.3MB. Free memory was 61.3MB in the beginning and 56.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1392.51ms. Allocated memory was 136.3MB in the beginning and 199.2MB in the end (delta: 62.9MB). Free memory was 56.2MB in the beginning and 74.1MB in the end (delta: -17.8MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33514.33ms. Allocated memory was 199.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 73.0MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 4.2GB. Free memory is still 1.9GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2449; [L862] FCALL, FORK 0 pthread_create(&t2449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2449={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2450; [L864] FCALL, FORK 0 pthread_create(&t2450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2449={7:0}, t2450={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L865] 0 pthread_t t2451; [L866] FCALL, FORK 0 pthread_create(&t2451, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2449={7:0}, t2450={5:0}, t2451={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 x$flush_delayed = weak$$choice2 [L820] EXPR 3 \read(x) [L820] 3 x$mem_tmp = x [L821] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] EXPR 3 \read(x) [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L823] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L824] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L825] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L826] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L828] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L829] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L830] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L831] EXPR 3 \read(x) [L831] 3 __unbuffered_p2_EAX = x [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] 3 x = x$flush_delayed ? x$mem_tmp : x [L833] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L836] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L839] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L839] EXPR 3 \read(x) [L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L839] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L839] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L840] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L841] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L842] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L843] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L791] 2 x$w_buff1 = x$w_buff0 [L792] 2 x$w_buff0 = 1 [L793] 2 x$w_buff1_used = x$w_buff0_used [L794] 2 x$w_buff0_used = (_Bool)1 [L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L846] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2449={7:0}, t2450={5:0}, t2451={6:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L872] EXPR 0 \read(x) [L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L873] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L874] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L875] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L876] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2449={7:0}, t2450={5:0}, t2451={6:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L879] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L880] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L880] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L881] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2449={7:0}, t2450={5:0}, t2451={6:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 __assert_fail ("0", "safe028_power.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: -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: -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: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 91 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: 33.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 982 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 830 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2534 IncrementalHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 25 mSDtfsCounter, 2534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=18, InterpolantAutomatonStates: 81, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 2052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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 [2023-11-29 00:03:52,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe028_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 0d78821bc3a287b999f98be361d707254bd2fa61b63b525cf42d392168336d80 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:03:54,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:03:54,823 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 00:03:54,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:03:54,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:03:54,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:03:54,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:03:54,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:03:54,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:03:54,866 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:03:54,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:03:54,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:03:54,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:03:54,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:03:54,869 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:03:54,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:03:54,870 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:03:54,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:03:54,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:03:54,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:03:54,872 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:03:54,873 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:03:54,873 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:03:54,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:03:54,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:03:54,874 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:03:54,875 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:03:54,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:03:54,876 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:03:54,876 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:03:54,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:03:54,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:03:54,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:03:54,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:03:54,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:03:54,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:03:54,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:03:54,879 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:03:54,879 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:03:54,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:03:54,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:03:54,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:03:54,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:03:54,880 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:03:54,880 INFO L153 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_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0d78821bc3a287b999f98be361d707254bd2fa61b63b525cf42d392168336d80 [2023-11-29 00:03:55,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:03:55,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:03:55,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:03:55,194 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:03:55,194 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:03:55,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe028_power.i [2023-11-29 00:03:57,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:03:58,162 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:03:58,163 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/sv-benchmarks/c/pthread-wmm/safe028_power.i [2023-11-29 00:03:58,179 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/data/6a34766f2/65ebb20bfe4946729084c5e2322dc218/FLAGe5709900f [2023-11-29 00:03:58,194 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/data/6a34766f2/65ebb20bfe4946729084c5e2322dc218 [2023-11-29 00:03:58,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:03:58,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:03:58,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:03:58,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:03:58,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:03:58,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee14841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58, skipping insertion in model container [2023-11-29 00:03:58,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,260 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:03:58,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:03:58,670 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:03:58,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:03:58,772 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:03:58,772 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:03:58,779 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:03:58,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58 WrapperNode [2023-11-29 00:03:58,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:03:58,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:03:58,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:03:58,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:03:58,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,837 INFO L138 Inliner]: procedures = 180, calls = 78, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 184 [2023-11-29 00:03:58,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:03:58,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:03:58,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:03:58,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:03:58,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,877 INFO L175 MemorySlicer]: Split 27 memory accesses to 5 slices as follows [2, 1, 22, 1, 1]. 81 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0, 0]. The 10 writes are split as follows [0, 1, 7, 1, 1]. [2023-11-29 00:03:58,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:03:58,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:03:58,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:03:58,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:03:58,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:03:58,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:58,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:03:58,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:03:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 00:03:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 00:03:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 00:03:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 00:03:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 00:03:58,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 00:03:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:03:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:03:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:03:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 00:03:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 00:03:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 00:03:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 00:03:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 00:03:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:03:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:03:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:03:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:03:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 00:03:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-29 00:03:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-29 00:03:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-29 00:03:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-29 00:03:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-11-29 00:03:58,984 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 00:03:58,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 00:03:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 00:03:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 00:03:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 00:03:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 00:03:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 00:03:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:03:58,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:03:58,994 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:03:59,173 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:03:59,175 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:03:59,882 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:04:00,622 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:04:00,622 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:04:00,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:00 BoogieIcfgContainer [2023-11-29 00:04:00,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:04:00,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:04:00,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:04:00,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:04:00,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:03:58" (1/3) ... [2023-11-29 00:04:00,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d0befb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:04:00, skipping insertion in model container [2023-11-29 00:04:00,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (2/3) ... [2023-11-29 00:04:00,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d0befb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:04:00, skipping insertion in model container [2023-11-29 00:04:00,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:00" (3/3) ... [2023-11-29 00:04:00,631 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_power.i [2023-11-29 00:04:00,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:04:00,651 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2023-11-29 00:04:00,651 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:04:00,829 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:04:00,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 202 flow [2023-11-29 00:04:00,921 INFO L124 PetriNetUnfolderBase]: 2/92 cut-off events. [2023-11-29 00:04:00,921 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:04:00,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 335 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-29 00:04:00,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 202 flow [2023-11-29 00:04:00,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2023-11-29 00:04:00,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:04:00,948 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;@4cbd3f00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:04:00,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2023-11-29 00:04:00,952 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:04:00,952 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 00:04:00,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:04:00,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:00,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:04:00,953 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:00,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash 31426, now seen corresponding path program 1 times [2023-11-29 00:04:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:00,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341426078] [2023-11-29 00:04:00,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:00,971 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 [2023-11-29 00:04:00,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:00,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:00,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:04:01,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:01,213 INFO L378 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 [2023-11-29 00:04:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:01,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:01,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:01,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341426078] [2023-11-29 00:04:01,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341426078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:01,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:01,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:04:01,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733078618] [2023-11-29 00:04:01,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:01,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:04:01,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:04:01,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:01,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2023-11-29 00:04:01,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:01,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:01,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2023-11-29 00:04:01,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:05,975 INFO L124 PetriNetUnfolderBase]: 17186/26464 cut-off events. [2023-11-29 00:04:05,976 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-29 00:04:06,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50609 conditions, 26464 events. 17186/26464 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 2660. Compared 236872 event pairs, 14856 based on Foata normal form. 900/13857 useless extension candidates. Maximal degree in co-relation 50595. Up to 20808 conditions per place. [2023-11-29 00:04:06,198 INFO L140 encePairwiseOnDemand]: 66/95 looper letters, 61 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-11-29 00:04:06,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 85 transitions, 305 flow [2023-11-29 00:04:06,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:04:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:04:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2023-11-29 00:04:06,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6631578947368421 [2023-11-29 00:04:06,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 189 transitions. [2023-11-29 00:04:06,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 189 transitions. [2023-11-29 00:04:06,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:06,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 189 transitions. [2023-11-29 00:04:06,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:06,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:06,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:06,224 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 193 flow. Second operand 3 states and 189 transitions. [2023-11-29 00:04:06,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 85 transitions, 305 flow [2023-11-29 00:04:06,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 85 transitions, 302 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:04:06,234 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 138 flow [2023-11-29 00:04:06,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2023-11-29 00:04:06,239 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -27 predicate places. [2023-11-29 00:04:06,239 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 138 flow [2023-11-29 00:04:06,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:06,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:06,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:04:06,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:06,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:06,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:06,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:06,442 INFO L85 PathProgramCache]: Analyzing trace with hash 31427, now seen corresponding path program 1 times [2023-11-29 00:04:06,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:06,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808324925] [2023-11-29 00:04:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:06,442 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 [2023-11-29 00:04:06,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:06,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:06,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:04:06,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:06,597 INFO L378 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 [2023-11-29 00:04:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:06,609 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:06,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:06,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808324925] [2023-11-29 00:04:06,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808324925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:06,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:06,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:04:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638406168] [2023-11-29 00:04:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:06,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:04:06,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:06,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:04:06,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:06,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 95 [2023-11-29 00:04:06,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:06,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:06,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 95 [2023-11-29 00:04:06,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:10,509 INFO L124 PetriNetUnfolderBase]: 17186/26463 cut-off events. [2023-11-29 00:04:10,509 INFO L125 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2023-11-29 00:04:10,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51056 conditions, 26463 events. 17186/26463 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 2660. Compared 237185 event pairs, 14856 based on Foata normal form. 1/12957 useless extension candidates. Maximal degree in co-relation 51045. Up to 20807 conditions per place. [2023-11-29 00:04:10,645 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 60 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-11-29 00:04:10,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 302 flow [2023-11-29 00:04:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:04:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:04:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 00:04:10,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2023-11-29 00:04:10,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 00:04:10,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 00:04:10,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:10,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 00:04:10,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:10,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:10,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:10,653 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 138 flow. Second operand 3 states and 141 transitions. [2023-11-29 00:04:10,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 302 flow [2023-11-29 00:04:10,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:10,734 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 136 flow [2023-11-29 00:04:10,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2023-11-29 00:04:10,735 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2023-11-29 00:04:10,735 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 136 flow [2023-11-29 00:04:10,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:10,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:10,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:04:10,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:10,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:10,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:10,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:10,937 INFO L85 PathProgramCache]: Analyzing trace with hash 937213933, now seen corresponding path program 1 times [2023-11-29 00:04:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:10,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825840146] [2023-11-29 00:04:10,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:10,938 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 [2023-11-29 00:04:10,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:10,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:10,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:11,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:04:11,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:11,056 INFO L378 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 [2023-11-29 00:04:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:11,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:11,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:11,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825840146] [2023-11-29 00:04:11,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825840146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:11,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:11,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:04:11,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704644687] [2023-11-29 00:04:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:11,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:04:11,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:11,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:04:11,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:11,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2023-11-29 00:04:11,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:11,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:11,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2023-11-29 00:04:11,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:14,525 INFO L124 PetriNetUnfolderBase]: 17190/26462 cut-off events. [2023-11-29 00:04:14,525 INFO L125 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2023-11-29 00:04:14,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51064 conditions, 26462 events. 17190/26462 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 2660. Compared 235263 event pairs, 10820 based on Foata normal form. 0/12963 useless extension candidates. Maximal degree in co-relation 51053. Up to 20810 conditions per place. [2023-11-29 00:04:14,695 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 61 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-11-29 00:04:14,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 83 transitions, 302 flow [2023-11-29 00:04:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:04:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:04:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2023-11-29 00:04:14,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48771929824561405 [2023-11-29 00:04:14,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 139 transitions. [2023-11-29 00:04:14,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 139 transitions. [2023-11-29 00:04:14,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:14,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 139 transitions. [2023-11-29 00:04:14,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:14,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:14,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:14,700 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 136 flow. Second operand 3 states and 139 transitions. [2023-11-29 00:04:14,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 83 transitions, 302 flow [2023-11-29 00:04:14,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:14,747 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 134 flow [2023-11-29 00:04:14,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-29 00:04:14,748 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -29 predicate places. [2023-11-29 00:04:14,748 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 134 flow [2023-11-29 00:04:14,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:14,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:14,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:04:14,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:14,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:14,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:14,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash 937213934, now seen corresponding path program 1 times [2023-11-29 00:04:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:14,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609945174] [2023-11-29 00:04:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:14,951 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 [2023-11-29 00:04:14,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:14,952 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:14,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:15,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:04:15,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:15,066 INFO L378 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 [2023-11-29 00:04:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:15,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:15,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609945174] [2023-11-29 00:04:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609945174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:15,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:04:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130772755] [2023-11-29 00:04:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:15,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:04:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:04:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:15,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 95 [2023-11-29 00:04:15,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:15,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:15,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 95 [2023-11-29 00:04:15,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:18,618 INFO L124 PetriNetUnfolderBase]: 17186/26453 cut-off events. [2023-11-29 00:04:18,619 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES. [2023-11-29 00:04:18,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51050 conditions, 26453 events. 17186/26453 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 2660. Compared 235146 event pairs, 10820 based on Foata normal form. 5/12963 useless extension candidates. Maximal degree in co-relation 51040. Up to 20801 conditions per place. [2023-11-29 00:04:18,765 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 60 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-11-29 00:04:18,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 298 flow [2023-11-29 00:04:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:04:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:04:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 00:04:18,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2023-11-29 00:04:18,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 00:04:18,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 00:04:18,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:18,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 00:04:18,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:18,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:18,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:18,769 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 134 flow. Second operand 3 states and 141 transitions. [2023-11-29 00:04:18,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 298 flow [2023-11-29 00:04:18,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 82 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:18,780 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 132 flow [2023-11-29 00:04:18,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 00:04:18,781 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -30 predicate places. [2023-11-29 00:04:18,781 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 132 flow [2023-11-29 00:04:18,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:18,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:18,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:18,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:18,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:18,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:18,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:18,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1278444748, now seen corresponding path program 1 times [2023-11-29 00:04:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:18,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508167816] [2023-11-29 00:04:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:18,984 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 [2023-11-29 00:04:18,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:18,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:18,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:19,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:04:19,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:19,133 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 00:04:19,134 INFO L378 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 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 00:04:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:19,185 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:19,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508167816] [2023-11-29 00:04:19,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508167816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:19,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:19,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:04:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562359871] [2023-11-29 00:04:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:19,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:04:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:04:19,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:19,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:04:19,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:19,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:19,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:04:19,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:20,694 INFO L124 PetriNetUnfolderBase]: 7290/11513 cut-off events. [2023-11-29 00:04:20,694 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2023-11-29 00:04:20,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22193 conditions, 11513 events. 7290/11513 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 94973 event pairs, 5610 based on Foata normal form. 0/6772 useless extension candidates. Maximal degree in co-relation 22183. Up to 7435 conditions per place. [2023-11-29 00:04:20,750 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 52 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-29 00:04:20,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 266 flow [2023-11-29 00:04:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:04:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:04:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 00:04:20,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017543859649123 [2023-11-29 00:04:20,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 00:04:20,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 00:04:20,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:20,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 00:04:20,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:20,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:20,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:20,755 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 132 flow. Second operand 3 states and 143 transitions. [2023-11-29 00:04:20,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 266 flow [2023-11-29 00:04:20,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:20,760 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 142 flow [2023-11-29 00:04:20,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2023-11-29 00:04:20,761 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -31 predicate places. [2023-11-29 00:04:20,761 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 142 flow [2023-11-29 00:04:20,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:20,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:20,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:20,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:20,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:20,962 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:20,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:20,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1278444747, now seen corresponding path program 1 times [2023-11-29 00:04:20,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:20,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109437520] [2023-11-29 00:04:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:20,964 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 [2023-11-29 00:04:20,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:20,965 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:20,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:21,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:04:21,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:21,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:21,091 INFO L378 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 14 treesize of output 9 [2023-11-29 00:04:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:21,152 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:21,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:21,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109437520] [2023-11-29 00:04:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109437520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:21,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:21,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:04:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630279648] [2023-11-29 00:04:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:21,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:04:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:21,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:04:21,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:21,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:04:21,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:21,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:21,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:04:21,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:21,756 INFO L124 PetriNetUnfolderBase]: 2016/3369 cut-off events. [2023-11-29 00:04:21,757 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-29 00:04:21,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6895 conditions, 3369 events. 2016/3369 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 24179 event pairs, 2016 based on Foata normal form. 0/2896 useless extension candidates. Maximal degree in co-relation 6883. Up to 2985 conditions per place. [2023-11-29 00:04:21,771 INFO L140 encePairwiseOnDemand]: 86/95 looper letters, 30 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-11-29 00:04:21,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 188 flow [2023-11-29 00:04:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:04:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:04:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 00:04:21,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2023-11-29 00:04:21,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 00:04:21,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 00:04:21,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:21,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 00:04:21,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:21,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:21,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:21,774 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 142 flow. Second operand 3 states and 120 transitions. [2023-11-29 00:04:21,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 188 flow [2023-11-29 00:04:21,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 51 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:21,776 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 124 flow [2023-11-29 00:04:21,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-11-29 00:04:21,777 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -39 predicate places. [2023-11-29 00:04:21,777 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 124 flow [2023-11-29 00:04:21,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:21,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:21,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:21,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:21,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:21,978 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:21,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:21,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1041105963, now seen corresponding path program 1 times [2023-11-29 00:04:21,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:21,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532374857] [2023-11-29 00:04:21,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:21,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 [2023-11-29 00:04:21,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:21,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:21,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:22,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:04:22,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:22,098 INFO L378 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 [2023-11-29 00:04:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:22,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:22,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:22,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532374857] [2023-11-29 00:04:22,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532374857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:22,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:22,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:04:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980083377] [2023-11-29 00:04:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:22,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:04:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:22,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:04:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:22,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2023-11-29 00:04:22,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:22,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:22,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2023-11-29 00:04:22,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:22,683 INFO L124 PetriNetUnfolderBase]: 2038/3373 cut-off events. [2023-11-29 00:04:22,683 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-29 00:04:22,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6876 conditions, 3373 events. 2038/3373 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 23636 event pairs, 1342 based on Foata normal form. 0/2918 useless extension candidates. Maximal degree in co-relation 6869. Up to 1766 conditions per place. [2023-11-29 00:04:22,697 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 39 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 00:04:22,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 222 flow [2023-11-29 00:04:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:04:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:04:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 00:04:22,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105263157894737 [2023-11-29 00:04:22,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 00:04:22,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 00:04:22,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:22,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 00:04:22,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:22,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:22,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:22,700 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 124 flow. Second operand 3 states and 117 transitions. [2023-11-29 00:04:22,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 222 flow [2023-11-29 00:04:22,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:04:22,701 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 125 flow [2023-11-29 00:04:22,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 00:04:22,702 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -39 predicate places. [2023-11-29 00:04:22,702 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 125 flow [2023-11-29 00:04:22,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:22,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:22,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:22,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:22,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:22,903 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:22,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:22,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1041105962, now seen corresponding path program 1 times [2023-11-29 00:04:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:22,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040396319] [2023-11-29 00:04:22,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:22,904 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 [2023-11-29 00:04:22,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:22,905 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:22,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:23,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:04:23,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:23,018 INFO L378 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 [2023-11-29 00:04:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:23,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:23,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040396319] [2023-11-29 00:04:23,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040396319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:23,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:23,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:04:23,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50234983] [2023-11-29 00:04:23,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:23,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:04:23,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:23,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:04:23,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:23,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 95 [2023-11-29 00:04:23,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:23,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:23,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 95 [2023-11-29 00:04:23,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:23,619 INFO L124 PetriNetUnfolderBase]: 2016/3315 cut-off events. [2023-11-29 00:04:23,619 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-11-29 00:04:23,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6856 conditions, 3315 events. 2016/3315 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 23713 event pairs, 1330 based on Foata normal form. 15/2905 useless extension candidates. Maximal degree in co-relation 6849. Up to 1729 conditions per place. [2023-11-29 00:04:23,631 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 38 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 00:04:23,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 221 flow [2023-11-29 00:04:23,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:04:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:04:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 00:04:23,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41754385964912283 [2023-11-29 00:04:23,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 00:04:23,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 00:04:23,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:23,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 00:04:23,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:23,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:23,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:23,635 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 125 flow. Second operand 3 states and 119 transitions. [2023-11-29 00:04:23,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 221 flow [2023-11-29 00:04:23,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:23,637 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 123 flow [2023-11-29 00:04:23,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-29 00:04:23,638 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -40 predicate places. [2023-11-29 00:04:23,638 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 123 flow [2023-11-29 00:04:23,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:23,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:23,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:23,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:23,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:23,839 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:23,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1041104724, now seen corresponding path program 1 times [2023-11-29 00:04:23,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:23,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036394610] [2023-11-29 00:04:23,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:23,840 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 [2023-11-29 00:04:23,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:23,841 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:23,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:23,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:04:23,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:23,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:23,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:23,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036394610] [2023-11-29 00:04:23,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036394610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:23,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:23,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:04:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547239636] [2023-11-29 00:04:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:23,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:04:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:04:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:23,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:04:23,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:23,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:23,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:04:23,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:24,447 INFO L124 PetriNetUnfolderBase]: 1627/2680 cut-off events. [2023-11-29 00:04:24,447 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-11-29 00:04:24,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5591 conditions, 2680 events. 1627/2680 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 18822 event pairs, 224 based on Foata normal form. 0/2466 useless extension candidates. Maximal degree in co-relation 5584. Up to 2026 conditions per place. [2023-11-29 00:04:24,458 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 49 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 00:04:24,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 280 flow [2023-11-29 00:04:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:04:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:04:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2023-11-29 00:04:24,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-11-29 00:04:24,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2023-11-29 00:04:24,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2023-11-29 00:04:24,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:24,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2023-11-29 00:04:24,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:24,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:24,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:24,462 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 123 flow. Second operand 3 states and 133 transitions. [2023-11-29 00:04:24,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 280 flow [2023-11-29 00:04:24,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:24,464 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 121 flow [2023-11-29 00:04:24,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-29 00:04:24,464 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2023-11-29 00:04:24,465 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 121 flow [2023-11-29 00:04:24,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:24,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:24,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:24,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:24,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:24,666 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:24,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2134301977, now seen corresponding path program 1 times [2023-11-29 00:04:24,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:24,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133127534] [2023-11-29 00:04:24,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:24,666 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 [2023-11-29 00:04:24,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:24,667 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:24,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:24,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:04:24,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:24,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:24,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133127534] [2023-11-29 00:04:24,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133127534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:24,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:24,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:04:24,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501154049] [2023-11-29 00:04:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:24,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:04:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:24,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:04:24,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:04:24,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 95 [2023-11-29 00:04:24,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:24,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:24,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 95 [2023-11-29 00:04:24,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:25,474 INFO L124 PetriNetUnfolderBase]: 2810/4544 cut-off events. [2023-11-29 00:04:25,474 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2023-11-29 00:04:25,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9361 conditions, 4544 events. 2810/4544 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 29710 event pairs, 338 based on Foata normal form. 100/4380 useless extension candidates. Maximal degree in co-relation 9353. Up to 3255 conditions per place. [2023-11-29 00:04:25,489 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 53 selfloop transitions, 5 changer transitions 1/73 dead transitions. [2023-11-29 00:04:25,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 297 flow [2023-11-29 00:04:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:04:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:04:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2023-11-29 00:04:25,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026315789473684 [2023-11-29 00:04:25,491 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 153 transitions. [2023-11-29 00:04:25,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 153 transitions. [2023-11-29 00:04:25,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:25,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 153 transitions. [2023-11-29 00:04:25,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:25,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:25,492 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:25,493 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 121 flow. Second operand 4 states and 153 transitions. [2023-11-29 00:04:25,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 297 flow [2023-11-29 00:04:25,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:25,494 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 151 flow [2023-11-29 00:04:25,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 00:04:25,495 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2023-11-29 00:04:25,495 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 151 flow [2023-11-29 00:04:25,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:25,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:25,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:25,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:25,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:25,696 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:25,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash -24200904, now seen corresponding path program 1 times [2023-11-29 00:04:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:25,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634958666] [2023-11-29 00:04:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:25,697 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 [2023-11-29 00:04:25,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:25,698 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:25,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:25,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:04:25,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:25,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:25,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:25,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634958666] [2023-11-29 00:04:25,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634958666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:25,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:25,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:04:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623010037] [2023-11-29 00:04:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:25,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:04:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:25,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:04:25,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:04:25,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 95 [2023-11-29 00:04:25,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:25,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:25,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 95 [2023-11-29 00:04:25,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:26,315 INFO L124 PetriNetUnfolderBase]: 1412/2372 cut-off events. [2023-11-29 00:04:26,315 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2023-11-29 00:04:26,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5321 conditions, 2372 events. 1412/2372 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13656 event pairs, 122 based on Foata normal form. 82/2342 useless extension candidates. Maximal degree in co-relation 5311. Up to 1281 conditions per place. [2023-11-29 00:04:26,322 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 64 selfloop transitions, 8 changer transitions 1/87 dead transitions. [2023-11-29 00:04:26,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 390 flow [2023-11-29 00:04:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:04:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:04:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-29 00:04:26,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2023-11-29 00:04:26,324 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-29 00:04:26,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-29 00:04:26,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:26,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-29 00:04:26,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:26,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:26,326 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:26,326 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 151 flow. Second operand 5 states and 190 transitions. [2023-11-29 00:04:26,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 390 flow [2023-11-29 00:04:26,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 380 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:26,329 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 191 flow [2023-11-29 00:04:26,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-29 00:04:26,329 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -34 predicate places. [2023-11-29 00:04:26,329 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 191 flow [2023-11-29 00:04:26,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:26,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:26,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:26,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:26,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:26,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:26,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash -295550494, now seen corresponding path program 1 times [2023-11-29 00:04:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194877594] [2023-11-29 00:04:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:26,531 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 [2023-11-29 00:04:26,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:26,532 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:26,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:26,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:04:26,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:26,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:26,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194877594] [2023-11-29 00:04:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194877594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:26,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:26,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:04:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807499882] [2023-11-29 00:04:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:26,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:04:26,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:26,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:04:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:04:26,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 95 [2023-11-29 00:04:26,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:26,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:26,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 95 [2023-11-29 00:04:26,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:27,118 INFO L124 PetriNetUnfolderBase]: 627/1049 cut-off events. [2023-11-29 00:04:27,118 INFO L125 PetriNetUnfolderBase]: For 762/762 co-relation queries the response was YES. [2023-11-29 00:04:27,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 1049 events. 627/1049 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4751 event pairs, 81 based on Foata normal form. 40/1057 useless extension candidates. Maximal degree in co-relation 2655. Up to 308 conditions per place. [2023-11-29 00:04:27,122 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 50 selfloop transitions, 11 changer transitions 2/77 dead transitions. [2023-11-29 00:04:27,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 361 flow [2023-11-29 00:04:27,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:04:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:04:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2023-11-29 00:04:27,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.356140350877193 [2023-11-29 00:04:27,124 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 203 transitions. [2023-11-29 00:04:27,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 203 transitions. [2023-11-29 00:04:27,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:27,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 203 transitions. [2023-11-29 00:04:27,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:27,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:27,126 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:27,126 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 191 flow. Second operand 6 states and 203 transitions. [2023-11-29 00:04:27,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 361 flow [2023-11-29 00:04:27,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 334 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-29 00:04:27,129 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 177 flow [2023-11-29 00:04:27,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2023-11-29 00:04:27,130 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2023-11-29 00:04:27,130 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 177 flow [2023-11-29 00:04:27,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:27,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:27,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:27,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:27,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:27,331 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:27,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1180723793, now seen corresponding path program 1 times [2023-11-29 00:04:27,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:27,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372781608] [2023-11-29 00:04:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:27,332 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 [2023-11-29 00:04:27,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:27,333 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:27,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:27,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:04:27,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:27,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:27,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:27,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372781608] [2023-11-29 00:04:27,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372781608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:27,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:27,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:04:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739874614] [2023-11-29 00:04:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:27,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:04:27,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:27,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:04:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:04:27,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:04:27,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:27,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:27,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:04:27,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:27,747 INFO L124 PetriNetUnfolderBase]: 331/676 cut-off events. [2023-11-29 00:04:27,747 INFO L125 PetriNetUnfolderBase]: For 278/290 co-relation queries the response was YES. [2023-11-29 00:04:27,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 676 events. 331/676 cut-off events. For 278/290 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3337 event pairs, 88 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 1503. Up to 374 conditions per place. [2023-11-29 00:04:27,750 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 29 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 00:04:27,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 255 flow [2023-11-29 00:04:27,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:04:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:04:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2023-11-29 00:04:27,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2023-11-29 00:04:27,751 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 140 transitions. [2023-11-29 00:04:27,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 140 transitions. [2023-11-29 00:04:27,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:27,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 140 transitions. [2023-11-29 00:04:27,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:27,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:27,753 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:27,753 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 177 flow. Second operand 4 states and 140 transitions. [2023-11-29 00:04:27,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 255 flow [2023-11-29 00:04:27,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 199 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 00:04:27,755 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 123 flow [2023-11-29 00:04:27,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 00:04:27,756 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -45 predicate places. [2023-11-29 00:04:27,756 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 123 flow [2023-11-29 00:04:27,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:27,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:27,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:27,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:27,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:27,957 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:27,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1426991134, now seen corresponding path program 1 times [2023-11-29 00:04:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061863973] [2023-11-29 00:04:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:27,958 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 [2023-11-29 00:04:27,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:27,959 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:27,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:28,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:04:28,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:28,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:28,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:28,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061863973] [2023-11-29 00:04:28,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061863973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:28,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:28,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:04:28,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132582193] [2023-11-29 00:04:28,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:28,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:04:28,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:28,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:04:28,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:04:28,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:04:28,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:28,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:28,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:04:28,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:28,417 INFO L124 PetriNetUnfolderBase]: 319/656 cut-off events. [2023-11-29 00:04:28,417 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 00:04:28,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 656 events. 319/656 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3210 event pairs, 88 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 1293. Up to 374 conditions per place. [2023-11-29 00:04:28,419 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 25 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-29 00:04:28,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 187 flow [2023-11-29 00:04:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:04:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:04:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-11-29 00:04:28,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35789473684210527 [2023-11-29 00:04:28,420 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 136 transitions. [2023-11-29 00:04:28,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 136 transitions. [2023-11-29 00:04:28,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:28,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 136 transitions. [2023-11-29 00:04:28,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:28,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:28,422 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:28,422 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 123 flow. Second operand 4 states and 136 transitions. [2023-11-29 00:04:28,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 187 flow [2023-11-29 00:04:28,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:28,423 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 122 flow [2023-11-29 00:04:28,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-29 00:04:28,423 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -45 predicate places. [2023-11-29 00:04:28,423 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 122 flow [2023-11-29 00:04:28,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:28,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:28,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:28,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:28,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:28,624 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:28,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash -406314817, now seen corresponding path program 1 times [2023-11-29 00:04:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:28,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315248887] [2023-11-29 00:04:28,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:28,625 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 [2023-11-29 00:04:28,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:28,626 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:28,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:28,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:04:28,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:29,268 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t2449~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2451~0#1.base_45| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2450~0#1.base_53| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2449~0#1.base_57| (_ bv1 1)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2449~0#1.base_57|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t2450~0#1.base_53|)) (= (select (store .cse0 |v_ULTIMATE.start_main_~#t2450~0#1.base_53| (_ bv1 1)) |v_ULTIMATE.start_main_~#t2451~0#1.base_45|) (_ bv0 1)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2449~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2450~0#1.base_53| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2451~0#1.base_45| (_ bv0 1)) |c_#valid|)))) is different from true [2023-11-29 00:04:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:29,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:29,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:29,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315248887] [2023-11-29 00:04:29,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315248887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:29,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:04:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222257416] [2023-11-29 00:04:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:29,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:04:29,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:29,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:04:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-29 00:04:29,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 95 [2023-11-29 00:04:29,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:29,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:29,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 95 [2023-11-29 00:04:29,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:29,657 INFO L124 PetriNetUnfolderBase]: 346/664 cut-off events. [2023-11-29 00:04:29,657 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-29 00:04:29,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 664 events. 346/664 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3266 event pairs, 190 based on Foata normal form. 8/616 useless extension candidates. Maximal degree in co-relation 1344. Up to 478 conditions per place. [2023-11-29 00:04:29,660 INFO L140 encePairwiseOnDemand]: 87/95 looper letters, 31 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-11-29 00:04:29,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 224 flow [2023-11-29 00:04:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:04:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:04:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2023-11-29 00:04:29,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24736842105263157 [2023-11-29 00:04:29,662 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 141 transitions. [2023-11-29 00:04:29,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 141 transitions. [2023-11-29 00:04:29,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:29,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 141 transitions. [2023-11-29 00:04:29,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:29,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:29,664 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:29,664 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 122 flow. Second operand 6 states and 141 transitions. [2023-11-29 00:04:29,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 224 flow [2023-11-29 00:04:29,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:04:29,665 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 151 flow [2023-11-29 00:04:29,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-29 00:04:29,666 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2023-11-29 00:04:29,666 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 151 flow [2023-11-29 00:04:29,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:29,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:29,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:29,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:29,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:29,867 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:29,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:29,867 INFO L85 PathProgramCache]: Analyzing trace with hash 923949963, now seen corresponding path program 1 times [2023-11-29 00:04:29,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:29,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286905748] [2023-11-29 00:04:29,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:29,868 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 [2023-11-29 00:04:29,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:29,868 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:29,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:30,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:04:30,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:30,149 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:30,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:30,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286905748] [2023-11-29 00:04:30,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286905748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:30,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:30,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:04:30,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313627798] [2023-11-29 00:04:30,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:30,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:04:30,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:30,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:04:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:04:30,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 95 [2023-11-29 00:04:30,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:30,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:30,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 95 [2023-11-29 00:04:30,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:30,567 INFO L124 PetriNetUnfolderBase]: 731/1426 cut-off events. [2023-11-29 00:04:30,567 INFO L125 PetriNetUnfolderBase]: For 388/436 co-relation queries the response was YES. [2023-11-29 00:04:30,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 1426 events. 731/1426 cut-off events. For 388/436 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8008 event pairs, 152 based on Foata normal form. 8/1390 useless extension candidates. Maximal degree in co-relation 3279. Up to 621 conditions per place. [2023-11-29 00:04:30,573 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 55 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2023-11-29 00:04:30,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 383 flow [2023-11-29 00:04:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:04:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:04:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2023-11-29 00:04:30,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35964912280701755 [2023-11-29 00:04:30,575 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 205 transitions. [2023-11-29 00:04:30,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 205 transitions. [2023-11-29 00:04:30,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:30,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 205 transitions. [2023-11-29 00:04:30,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:30,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:30,577 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:30,578 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 151 flow. Second operand 6 states and 205 transitions. [2023-11-29 00:04:30,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 383 flow [2023-11-29 00:04:30,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 82 transitions, 365 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:04:30,580 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 181 flow [2023-11-29 00:04:30,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-29 00:04:30,581 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2023-11-29 00:04:30,581 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 181 flow [2023-11-29 00:04:30,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:30,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:30,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:30,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 00:04:30,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:30,782 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:30,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:30,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1483852317, now seen corresponding path program 2 times [2023-11-29 00:04:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:30,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464692985] [2023-11-29 00:04:30,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:04:30,783 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 [2023-11-29 00:04:30,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:30,784 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:30,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:30,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 00:04:30,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:04:30,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 00:04:30,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:31,855 INFO L378 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 7 treesize of output 3 [2023-11-29 00:04:32,411 INFO L378 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 0 case distinctions, treesize of input 78 treesize of output 58 [2023-11-29 00:04:33,084 INFO L378 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 0 case distinctions, treesize of input 157 treesize of output 134 [2023-11-29 00:04:33,533 INFO L378 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 0 case distinctions, treesize of input 66 treesize of output 39 [2023-11-29 00:04:34,066 INFO L378 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 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 00:04:34,183 INFO L378 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 84 treesize of output 68 [2023-11-29 00:04:34,195 INFO L378 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 7 treesize of output 5 [2023-11-29 00:04:34,205 INFO L378 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 7 treesize of output 5 [2023-11-29 00:04:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:34,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:04:34,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464692985] [2023-11-29 00:04:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464692985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:34,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:34,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:04:34,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522022433] [2023-11-29 00:04:34,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:34,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:04:34,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:34,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:04:34,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:04:35,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 95 [2023-11-29 00:04:35,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 181 flow. Second operand has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:35,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:35,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 95 [2023-11-29 00:04:35,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:37,093 INFO L124 PetriNetUnfolderBase]: 1125/2162 cut-off events. [2023-11-29 00:04:37,093 INFO L125 PetriNetUnfolderBase]: For 769/825 co-relation queries the response was YES. [2023-11-29 00:04:37,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5371 conditions, 2162 events. 1125/2162 cut-off events. For 769/825 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13549 event pairs, 261 based on Foata normal form. 8/2073 useless extension candidates. Maximal degree in co-relation 5359. Up to 871 conditions per place. [2023-11-29 00:04:37,105 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 65 selfloop transitions, 16 changer transitions 0/106 dead transitions. [2023-11-29 00:04:37,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 525 flow [2023-11-29 00:04:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:04:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:04:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 312 transitions. [2023-11-29 00:04:37,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3649122807017544 [2023-11-29 00:04:37,107 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 312 transitions. [2023-11-29 00:04:37,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 312 transitions. [2023-11-29 00:04:37,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:37,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 312 transitions. [2023-11-29 00:04:37,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 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) [2023-11-29 00:04:37,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:37,109 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:37,109 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 181 flow. Second operand 9 states and 312 transitions. [2023-11-29 00:04:37,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 525 flow [2023-11-29 00:04:37,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 106 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:04:37,113 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 322 flow [2023-11-29 00:04:37,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=322, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2023-11-29 00:04:37,113 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -23 predicate places. [2023-11-29 00:04:37,113 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 322 flow [2023-11-29 00:04:37,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.545454545454547) internal successors, (314), 11 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:04:37,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:37,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:37,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:37,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:37,314 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2023-11-29 00:04:37,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:37,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1267359467, now seen corresponding path program 3 times [2023-11-29 00:04:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:37,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907518880] [2023-11-29 00:04:37,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:04:37,315 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 [2023-11-29 00:04:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:37,316 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:04:37,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:37,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 00:04:37,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 00:04:37,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:04:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:37,801 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 00:04:37,801 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:04:37,802 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining) [2023-11-29 00:04:37,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining) [2023-11-29 00:04:37,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining) [2023-11-29 00:04:37,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining) [2023-11-29 00:04:37,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining) [2023-11-29 00:04:37,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining) [2023-11-29 00:04:37,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining) [2023-11-29 00:04:37,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining) [2023-11-29 00:04:37,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining) [2023-11-29 00:04:37,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining) [2023-11-29 00:04:37,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining) [2023-11-29 00:04:37,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining) [2023-11-29 00:04:37,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining) [2023-11-29 00:04:37,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining) [2023-11-29 00:04:37,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining) [2023-11-29 00:04:37,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining) [2023-11-29 00:04:37,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining) [2023-11-29 00:04:37,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining) [2023-11-29 00:04:37,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining) [2023-11-29 00:04:37,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining) [2023-11-29 00:04:37,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining) [2023-11-29 00:04:37,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining) [2023-11-29 00:04:37,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining) [2023-11-29 00:04:37,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining) [2023-11-29 00:04:37,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining) [2023-11-29 00:04:37,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining) [2023-11-29 00:04:37,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining) [2023-11-29 00:04:37,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining) [2023-11-29 00:04:37,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining) [2023-11-29 00:04:37,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining) [2023-11-29 00:04:37,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining) [2023-11-29 00:04:37,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining) [2023-11-29 00:04:37,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining) [2023-11-29 00:04:37,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining) [2023-11-29 00:04:37,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining) [2023-11-29 00:04:37,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining) [2023-11-29 00:04:37,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining) [2023-11-29 00:04:37,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining) [2023-11-29 00:04:37,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining) [2023-11-29 00:04:37,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining) [2023-11-29 00:04:37,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining) [2023-11-29 00:04:37,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining) [2023-11-29 00:04:37,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining) [2023-11-29 00:04:37,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining) [2023-11-29 00:04:37,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining) [2023-11-29 00:04:37,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining) [2023-11-29 00:04:37,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining) [2023-11-29 00:04:37,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining) [2023-11-29 00:04:37,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining) [2023-11-29 00:04:37,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining) [2023-11-29 00:04:37,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining) [2023-11-29 00:04:37,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining) [2023-11-29 00:04:37,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining) [2023-11-29 00:04:37,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining) [2023-11-29 00:04:37,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining) [2023-11-29 00:04:37,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining) [2023-11-29 00:04:37,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining) [2023-11-29 00:04:37,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining) [2023-11-29 00:04:37,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining) [2023-11-29 00:04:37,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining) [2023-11-29 00:04:37,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining) [2023-11-29 00:04:37,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining) [2023-11-29 00:04:37,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining) [2023-11-29 00:04:37,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining) [2023-11-29 00:04:37,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining) [2023-11-29 00:04:37,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining) [2023-11-29 00:04:37,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining) [2023-11-29 00:04:37,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining) [2023-11-29 00:04:37,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining) [2023-11-29 00:04:37,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining) [2023-11-29 00:04:37,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining) [2023-11-29 00:04:37,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining) [2023-11-29 00:04:37,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining) [2023-11-29 00:04:37,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining) [2023-11-29 00:04:37,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining) [2023-11-29 00:04:37,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining) [2023-11-29 00:04:37,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining) [2023-11-29 00:04:37,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining) [2023-11-29 00:04:37,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining) [2023-11-29 00:04:37,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining) [2023-11-29 00:04:37,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining) [2023-11-29 00:04:37,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining) [2023-11-29 00:04:37,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining) [2023-11-29 00:04:37,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining) [2023-11-29 00:04:37,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining) [2023-11-29 00:04:37,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining) [2023-11-29 00:04:37,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining) [2023-11-29 00:04:37,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining) [2023-11-29 00:04:37,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining) [2023-11-29 00:04:37,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining) [2023-11-29 00:04:37,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining) [2023-11-29 00:04:37,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:04:38,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:04:38,019 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:38,024 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:04:38,024 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:04:38,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated [2023-11-29 00:04:38,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated [2023-11-29 00:04:38,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre37 could not be translated [2023-11-29 00:04:38,107 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:04:38,108 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:04:38,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:04:38 BasicIcfg [2023-11-29 00:04:38,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:04:38,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:04:38,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:04:38,127 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:04:38,127 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:00" (3/4) ... [2023-11-29 00:04:38,129 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:04:38,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:04:38,131 INFO L158 Benchmark]: Toolchain (without parser) took 39932.35ms. Allocated memory was 67.1MB in the beginning and 3.9GB in the end (delta: 3.9GB). Free memory was 38.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-11-29 00:04:38,131 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 67.1MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:04:38,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.65ms. Allocated memory was 67.1MB in the beginning and 94.4MB in the end (delta: 27.3MB). Free memory was 38.3MB in the beginning and 58.6MB in the end (delta: -20.2MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2023-11-29 00:04:38,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.03ms. Allocated memory is still 94.4MB. Free memory was 58.6MB in the beginning and 55.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:04:38,132 INFO L158 Benchmark]: Boogie Preprocessor took 69.93ms. Allocated memory is still 94.4MB. Free memory was 55.8MB in the beginning and 51.0MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:04:38,132 INFO L158 Benchmark]: RCFGBuilder took 1713.14ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 51.0MB in the beginning and 63.9MB in the end (delta: -12.9MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2023-11-29 00:04:38,133 INFO L158 Benchmark]: TraceAbstraction took 37501.24ms. Allocated memory was 113.2MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 62.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-11-29 00:04:38,133 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 3.9GB. Free memory is still 2.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:04:38,135 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 67.1MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.65ms. Allocated memory was 67.1MB in the beginning and 94.4MB in the end (delta: 27.3MB). Free memory was 38.3MB in the beginning and 58.6MB in the end (delta: -20.2MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.03ms. Allocated memory is still 94.4MB. Free memory was 58.6MB in the beginning and 55.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.93ms. Allocated memory is still 94.4MB. Free memory was 55.8MB in the beginning and 51.0MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1713.14ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 51.0MB in the beginning and 63.9MB in the end (delta: -12.9MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * TraceAbstraction took 37501.24ms. Allocated memory was 113.2MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 62.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 3.9GB. Free memory is still 2.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2449; [L862] FCALL, FORK 0 pthread_create(&t2449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2449={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2450; [L864] FCALL, FORK 0 pthread_create(&t2450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2449={6:0}, t2450={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L865] 0 pthread_t t2451; [L866] FCALL, FORK 0 pthread_create(&t2451, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2449={6:0}, t2450={5:0}, t2451={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 x$flush_delayed = weak$$choice2 [L820] EXPR 3 \read(x) [L820] 3 x$mem_tmp = x [L821] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] EXPR 3 \read(x) [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L823] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L824] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L825] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L826] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L828] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L829] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L830] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L831] EXPR 3 \read(x) [L831] 3 __unbuffered_p2_EAX = x [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] 3 x = x$flush_delayed ? x$mem_tmp : x [L833] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L836] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L791] 2 x$w_buff1 = x$w_buff0 [L792] 2 x$w_buff0 = 1 [L793] 2 x$w_buff1_used = x$w_buff0_used [L794] 2 x$w_buff0_used = (_Bool)1 [L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L839] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L839] EXPR 3 \read(x) [L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L839] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L839] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L840] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L841] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L842] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L843] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L846] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2449={6:0}, t2450={5:0}, t2451={7:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L872] EXPR 0 \read(x) [L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L873] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L874] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L875] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L876] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2449={6:0}, t2450={5:0}, t2451={7:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L879] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L880] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L880] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L881] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2449={6:0}, t2450={5:0}, t2451={7:0}, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 __assert_fail ("0", "safe028_power.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: -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: -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: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 91 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: 37.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 887 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 732 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 56 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2563 IncrementalHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 14 mSDtfsCounter, 2563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=17, InterpolantAutomatonStates: 71, 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, 1.0s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 247 ConstructedInterpolants, 1 QuantifiedInterpolants, 2884 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2545 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 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 [2023-11-29 00:04:38,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a88d179-f380-40b8-8d10-4392f8b35ffe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample