./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe015_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe015_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1568f4b0615eb98ed6bee584aeda19485d9df0ed08c84a8233a5817e939c5388 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:00:24,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:00:25,074 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:00:25,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:00:25,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:00:25,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:00:25,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:00:25,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:00:25,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:00:25,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:00:25,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:00:25,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:00:25,150 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:00:25,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:00:25,154 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:00:25,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:00:25,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:00:25,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:00:25,156 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:00:25,156 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:00:25,157 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:00:25,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:00:25,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:00:25,159 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:00:25,160 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:00:25,160 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:00:25,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:00:25,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:00:25,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:00:25,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:00:25,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:00:25,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:00:25,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:00:25,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:00:25,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:00:25,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:00:25,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:00:25,167 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:00:25,167 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_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1568f4b0615eb98ed6bee584aeda19485d9df0ed08c84a8233a5817e939c5388 [2023-11-06 22:00:25,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:00:25,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:00:25,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:00:25,578 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:00:25,578 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:00:25,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe015_power.oepc.i [2023-11-06 22:00:29,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:00:29,715 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:00:29,716 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/sv-benchmarks/c/pthread-wmm/safe015_power.oepc.i [2023-11-06 22:00:29,745 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/data/3c3e05ff6/224a222d5f9e4ed29b1d622c8d7caa76/FLAGfdb1c502f [2023-11-06 22:00:29,767 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/data/3c3e05ff6/224a222d5f9e4ed29b1d622c8d7caa76 [2023-11-06 22:00:29,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:00:29,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:00:29,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:00:29,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:00:29,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:00:29,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:00:29" (1/1) ... [2023-11-06 22:00:29,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428328c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:29, skipping insertion in model container [2023-11-06 22:00:29,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:00:29" (1/1) ... [2023-11-06 22:00:29,900 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:00:30,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:00:30,548 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:00:30,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:00:30,676 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:00:30,677 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:00:30,686 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:00:30,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30 WrapperNode [2023-11-06 22:00:30,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:00:30,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:00:30,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:00:30,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:00:30,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,816 INFO L138 Inliner]: procedures = 176, calls = 87, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 236 [2023-11-06 22:00:30,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:00:30,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:00:30,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:00:30,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:00:30,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:00:30,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:00:30,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:00:30,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:00:30,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (1/1) ... [2023-11-06 22:00:30,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:00:30,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:00:31,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:00:31,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:00:31,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:00:31,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:00:31,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:00:31,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:00:31,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:00:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:00:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:00:31,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:00:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:00:31,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:00:31,077 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:00:31,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:00:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:00:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:00:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:00:31,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:00:31,083 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:00:31,337 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:00:31,339 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:00:32,246 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:00:33,624 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:00:33,625 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:00:33,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:00:33 BoogieIcfgContainer [2023-11-06 22:00:33,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:00:33,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:00:33,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:00:33,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:00:33,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:00:29" (1/3) ... [2023-11-06 22:00:33,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4145dd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:00:33, skipping insertion in model container [2023-11-06 22:00:33,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:00:30" (2/3) ... [2023-11-06 22:00:33,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4145dd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:00:33, skipping insertion in model container [2023-11-06 22:00:33,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:00:33" (3/3) ... [2023-11-06 22:00:33,647 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.oepc.i [2023-11-06 22:00:33,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:00:33,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-11-06 22:00:33,674 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:00:33,934 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:00:33,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 198 transitions, 408 flow [2023-11-06 22:00:34,185 INFO L124 PetriNetUnfolderBase]: 3/195 cut-off events. [2023-11-06 22:00:34,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:00:34,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 195 events. 3/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 372 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-11-06 22:00:34,193 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 198 transitions, 408 flow [2023-11-06 22:00:34,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 195 transitions, 399 flow [2023-11-06 22:00:34,210 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:00:34,230 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 195 transitions, 399 flow [2023-11-06 22:00:34,233 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 195 transitions, 399 flow [2023-11-06 22:00:34,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 195 transitions, 399 flow [2023-11-06 22:00:34,318 INFO L124 PetriNetUnfolderBase]: 3/195 cut-off events. [2023-11-06 22:00:34,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:00:34,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 195 events. 3/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 371 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-11-06 22:00:34,330 INFO L119 LiptonReduction]: Number of co-enabled transitions 9868 [2023-11-06 22:01:01,577 INFO L134 LiptonReduction]: Checked pairs total: 67660 [2023-11-06 22:01:01,578 INFO L136 LiptonReduction]: Total number of compositions: 156 [2023-11-06 22:01:01,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:01:01,601 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;@1de1ab74, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:01:01,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2023-11-06 22:01:01,604 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:01:01,604 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:01:01,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:01:01,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:01:01,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:01:01,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-11-06 22:01:01,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1476, now seen corresponding path program 1 times [2023-11-06 22:01:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:01,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774050529] [2023-11-06 22:01:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:01,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:01,753 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-06 22:01:01,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:01,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774050529] [2023-11-06 22:01:01,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774050529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:01:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812372428] [2023-11-06 22:01:01,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:01,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:01:01,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:01,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:01:01,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:01:01,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 354 [2023-11-06 22:01:01,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 195 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 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-06 22:01:01,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:01:01,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 354 [2023-11-06 22:01:01,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:01:11,453 INFO L124 PetriNetUnfolderBase]: 27605/39102 cut-off events. [2023-11-06 22:01:11,453 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-06 22:01:11,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77635 conditions, 39102 events. 27605/39102 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 2999. Compared 272022 event pairs, 27605 based on Foata normal form. 0/16640 useless extension candidates. Maximal degree in co-relation 77624. Up to 38383 conditions per place. [2023-11-06 22:01:11,828 INFO L140 encePairwiseOnDemand]: 312/354 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-11-06 22:01:11,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-11-06 22:01:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:01:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:01:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 343 transitions. [2023-11-06 22:01:11,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844632768361582 [2023-11-06 22:01:11,858 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 343 transitions. [2023-11-06 22:01:11,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 343 transitions. [2023-11-06 22:01:11,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:01:11,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 343 transitions. [2023-11-06 22:01:11,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 171.5) internal successors, (343), 2 states have internal predecessors, (343), 0 states have call successors, (0), 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-06 22:01:11,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:01:11,882 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:01:11,885 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 195 flow. Second operand 2 states and 343 transitions. [2023-11-06 22:01:11,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-11-06 22:01:11,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:01:11,897 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-11-06 22:01:11,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=354, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-11-06 22:01:11,906 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -44 predicate places. [2023-11-06 22:01:11,906 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-11-06 22:01:11,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 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-06 22:01:11,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:01:11,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:01:11,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:01:11,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-11-06 22:01:11,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash 45281783, now seen corresponding path program 1 times [2023-11-06 22:01:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:11,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936995209] [2023-11-06 22:01:11,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:11,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:12,468 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-06 22:01:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:12,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936995209] [2023-11-06 22:01:12,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936995209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:12,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:12,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:01:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375168005] [2023-11-06 22:01:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:12,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:12,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:12,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:12,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:01:12,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 354 [2023-11-06 22:01:12,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-06 22:01:12,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:01:12,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 354 [2023-11-06 22:01:12,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:01:18,023 INFO L124 PetriNetUnfolderBase]: 17973/26138 cut-off events. [2023-11-06 22:01:18,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:01:18,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52077 conditions, 26138 events. 17973/26138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 175319 event pairs, 11673 based on Foata normal form. 0/14141 useless extension candidates. Maximal degree in co-relation 52074. Up to 16331 conditions per place. [2023-11-06 22:01:18,397 INFO L140 encePairwiseOnDemand]: 336/354 looper letters, 57 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2023-11-06 22:01:18,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 272 flow [2023-11-06 22:01:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:01:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-11-06 22:01:18,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4180790960451977 [2023-11-06 22:01:18,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-11-06 22:01:18,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-11-06 22:01:18,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:01:18,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-11-06 22:01:18,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:01:18,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 354.0) internal successors, (1416), 4 states have internal predecessors, (1416), 0 states have call successors, (0), 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-06 22:01:18,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 354.0) internal successors, (1416), 4 states have internal predecessors, (1416), 0 states have call successors, (0), 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-06 22:01:18,422 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 444 transitions. [2023-11-06 22:01:18,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 272 flow [2023-11-06 22:01:18,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:01:18,427 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 174 flow [2023-11-06 22:01:18,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=354, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-11-06 22:01:18,429 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -43 predicate places. [2023-11-06 22:01:18,431 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 174 flow [2023-11-06 22:01:18,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-06 22:01:18,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:01:18,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:01:18,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:01:18,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-11-06 22:01:18,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash 45281784, now seen corresponding path program 1 times [2023-11-06 22:01:18,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:18,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589167066] [2023-11-06 22:01:18,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:18,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:18,658 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-06 22:01:18,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:18,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589167066] [2023-11-06 22:01:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589167066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:18,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:18,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:01:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680921501] [2023-11-06 22:01:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:18,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:18,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:18,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:01:18,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 354 [2023-11-06 22:01:18,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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-06 22:01:18,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:01:18,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 354 [2023-11-06 22:01:18,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:01:21,189 INFO L124 PetriNetUnfolderBase]: 5943/9208 cut-off events. [2023-11-06 22:01:21,190 INFO L125 PetriNetUnfolderBase]: For 2521/2521 co-relation queries the response was YES. [2023-11-06 22:01:21,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23997 conditions, 9208 events. 5943/9208 cut-off events. For 2521/2521 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 58415 event pairs, 4835 based on Foata normal form. 1850/9104 useless extension candidates. Maximal degree in co-relation 23992. Up to 8555 conditions per place. [2023-11-06 22:01:21,284 INFO L140 encePairwiseOnDemand]: 344/354 looper letters, 40 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-11-06 22:01:21,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 238 flow [2023-11-06 22:01:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:01:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-11-06 22:01:21,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3973634651600753 [2023-11-06 22:01:21,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-11-06 22:01:21,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-11-06 22:01:21,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:01:21,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-11-06 22:01:21,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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-06 22:01:21,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 354.0) internal successors, (1416), 4 states have internal predecessors, (1416), 0 states have call successors, (0), 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-06 22:01:21,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 354.0) internal successors, (1416), 4 states have internal predecessors, (1416), 0 states have call successors, (0), 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-06 22:01:21,297 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 174 flow. Second operand 3 states and 422 transitions. [2023-11-06 22:01:21,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 238 flow [2023-11-06 22:01:21,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:01:21,330 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 140 flow [2023-11-06 22:01:21,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=354, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-11-06 22:01:21,333 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -52 predicate places. [2023-11-06 22:01:21,333 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 140 flow [2023-11-06 22:01:21,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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-06 22:01:21,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:01:21,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:01:21,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:01:21,342 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-11-06 22:01:21,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:21,343 INFO L85 PathProgramCache]: Analyzing trace with hash 566858588, now seen corresponding path program 1 times [2023-11-06 22:01:21,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:21,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022127010] [2023-11-06 22:01:21,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:21,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:01:21,686 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-06 22:01:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:01:21,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022127010] [2023-11-06 22:01:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022127010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:01:21,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:01:21,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:01:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256075222] [2023-11-06 22:01:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:01:21,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:01:21,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:01:21,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:01:21,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:01:21,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 354 [2023-11-06 22:01:21,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-06 22:01:21,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:01:21,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 354 [2023-11-06 22:01:21,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:01:24,161 INFO L124 PetriNetUnfolderBase]: 5150/7883 cut-off events. [2023-11-06 22:01:24,161 INFO L125 PetriNetUnfolderBase]: For 1155/1179 co-relation queries the response was YES. [2023-11-06 22:01:24,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19682 conditions, 7883 events. 5150/7883 cut-off events. For 1155/1179 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 49698 event pairs, 1357 based on Foata normal form. 0/5674 useless extension candidates. Maximal degree in co-relation 19677. Up to 6800 conditions per place. [2023-11-06 22:01:24,228 INFO L140 encePairwiseOnDemand]: 351/354 looper letters, 65 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-06 22:01:24,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 358 flow [2023-11-06 22:01:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:01:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:01:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-11-06 22:01:24,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096045197740113 [2023-11-06 22:01:24,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-11-06 22:01:24,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-11-06 22:01:24,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:01:24,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-11-06 22:01:24,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 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-06 22:01:24,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 354.0) internal successors, (1416), 4 states have internal predecessors, (1416), 0 states have call successors, (0), 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-06 22:01:24,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 354.0) internal successors, (1416), 4 states have internal predecessors, (1416), 0 states have call successors, (0), 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-06 22:01:24,247 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 140 flow. Second operand 3 states and 435 transitions. [2023-11-06 22:01:24,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 358 flow [2023-11-06 22:01:24,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:01:24,254 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 141 flow [2023-11-06 22:01:24,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=354, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2023-11-06 22:01:24,257 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -52 predicate places. [2023-11-06 22:01:24,257 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 141 flow [2023-11-06 22:01:24,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-06 22:01:24,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:01:24,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:01:24,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:01:24,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-11-06 22:01:24,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:01:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash 392748324, now seen corresponding path program 1 times [2023-11-06 22:01:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:01:24,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914978876] [2023-11-06 22:01:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:01:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:01:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:01:24,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:01:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:01:24,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:01:24,369 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:01:24,375 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2023-11-06 22:01:24,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 105 remaining) [2023-11-06 22:01:24,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 105 remaining) [2023-11-06 22:01:24,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 105 remaining) [2023-11-06 22:01:24,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 105 remaining) [2023-11-06 22:01:24,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 105 remaining) [2023-11-06 22:01:24,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 105 remaining) [2023-11-06 22:01:24,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 105 remaining) [2023-11-06 22:01:24,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 105 remaining) [2023-11-06 22:01:24,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 105 remaining) [2023-11-06 22:01:24,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 105 remaining) [2023-11-06 22:01:24,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 105 remaining) [2023-11-06 22:01:24,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 105 remaining) [2023-11-06 22:01:24,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (91 of 105 remaining) [2023-11-06 22:01:24,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (90 of 105 remaining) [2023-11-06 22:01:24,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 105 remaining) [2023-11-06 22:01:24,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 105 remaining) [2023-11-06 22:01:24,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 105 remaining) [2023-11-06 22:01:24,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 105 remaining) [2023-11-06 22:01:24,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 105 remaining) [2023-11-06 22:01:24,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 105 remaining) [2023-11-06 22:01:24,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 105 remaining) [2023-11-06 22:01:24,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 105 remaining) [2023-11-06 22:01:24,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 105 remaining) [2023-11-06 22:01:24,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 105 remaining) [2023-11-06 22:01:24,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 105 remaining) [2023-11-06 22:01:24,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 105 remaining) [2023-11-06 22:01:24,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 105 remaining) [2023-11-06 22:01:24,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 105 remaining) [2023-11-06 22:01:24,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 105 remaining) [2023-11-06 22:01:24,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 105 remaining) [2023-11-06 22:01:24,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 105 remaining) [2023-11-06 22:01:24,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 105 remaining) [2023-11-06 22:01:24,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 105 remaining) [2023-11-06 22:01:24,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 105 remaining) [2023-11-06 22:01:24,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 105 remaining) [2023-11-06 22:01:24,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 105 remaining) [2023-11-06 22:01:24,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 105 remaining) [2023-11-06 22:01:24,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 105 remaining) [2023-11-06 22:01:24,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 105 remaining) [2023-11-06 22:01:24,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 105 remaining) [2023-11-06 22:01:24,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 105 remaining) [2023-11-06 22:01:24,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 105 remaining) [2023-11-06 22:01:24,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 105 remaining) [2023-11-06 22:01:24,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 105 remaining) [2023-11-06 22:01:24,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 105 remaining) [2023-11-06 22:01:24,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 105 remaining) [2023-11-06 22:01:24,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 105 remaining) [2023-11-06 22:01:24,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 105 remaining) [2023-11-06 22:01:24,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 105 remaining) [2023-11-06 22:01:24,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 105 remaining) [2023-11-06 22:01:24,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 105 remaining) [2023-11-06 22:01:24,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 105 remaining) [2023-11-06 22:01:24,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 105 remaining) [2023-11-06 22:01:24,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 105 remaining) [2023-11-06 22:01:24,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 105 remaining) [2023-11-06 22:01:24,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 105 remaining) [2023-11-06 22:01:24,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 105 remaining) [2023-11-06 22:01:24,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 105 remaining) [2023-11-06 22:01:24,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 105 remaining) [2023-11-06 22:01:24,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 105 remaining) [2023-11-06 22:01:24,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 105 remaining) [2023-11-06 22:01:24,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 105 remaining) [2023-11-06 22:01:24,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (41 of 105 remaining) [2023-11-06 22:01:24,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (40 of 105 remaining) [2023-11-06 22:01:24,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 105 remaining) [2023-11-06 22:01:24,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 105 remaining) [2023-11-06 22:01:24,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 105 remaining) [2023-11-06 22:01:24,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 105 remaining) [2023-11-06 22:01:24,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 105 remaining) [2023-11-06 22:01:24,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 105 remaining) [2023-11-06 22:01:24,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 105 remaining) [2023-11-06 22:01:24,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 105 remaining) [2023-11-06 22:01:24,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 105 remaining) [2023-11-06 22:01:24,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 105 remaining) [2023-11-06 22:01:24,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 105 remaining) [2023-11-06 22:01:24,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 105 remaining) [2023-11-06 22:01:24,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 105 remaining) [2023-11-06 22:01:24,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 105 remaining) [2023-11-06 22:01:24,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 105 remaining) [2023-11-06 22:01:24,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 105 remaining) [2023-11-06 22:01:24,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 105 remaining) [2023-11-06 22:01:24,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 105 remaining) [2023-11-06 22:01:24,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 105 remaining) [2023-11-06 22:01:24,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 105 remaining) [2023-11-06 22:01:24,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 105 remaining) [2023-11-06 22:01:24,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 105 remaining) [2023-11-06 22:01:24,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 105 remaining) [2023-11-06 22:01:24,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 105 remaining) [2023-11-06 22:01:24,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 105 remaining) [2023-11-06 22:01:24,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 105 remaining) [2023-11-06 22:01:24,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 105 remaining) [2023-11-06 22:01:24,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 105 remaining) [2023-11-06 22:01:24,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 105 remaining) [2023-11-06 22:01:24,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 105 remaining) [2023-11-06 22:01:24,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 105 remaining) [2023-11-06 22:01:24,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 105 remaining) [2023-11-06 22:01:24,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 105 remaining) [2023-11-06 22:01:24,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 105 remaining) [2023-11-06 22:01:24,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 105 remaining) [2023-11-06 22:01:24,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 105 remaining) [2023-11-06 22:01:24,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 105 remaining) [2023-11-06 22:01:24,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 105 remaining) [2023-11-06 22:01:24,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 105 remaining) [2023-11-06 22:01:24,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 105 remaining) [2023-11-06 22:01:24,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:01:24,417 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:01:24,428 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:01:24,428 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:01:24,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:01:24 BasicIcfg [2023-11-06 22:01:24,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:01:24,498 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:01:24,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:01:24,498 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:01:24,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:00:33" (3/4) ... [2023-11-06 22:01:24,501 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:01:24,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:01:24,504 INFO L158 Benchmark]: Toolchain (without parser) took 54720.20ms. Allocated memory was 169.9MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 126.4MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-11-06 22:01:24,504 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 169.9MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:01:24,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 898.21ms. Allocated memory is still 169.9MB. Free memory was 126.4MB in the beginning and 99.9MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:01:24,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.40ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 96.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:01:24,509 INFO L158 Benchmark]: Boogie Preprocessor took 113.50ms. Allocated memory is still 169.9MB. Free memory was 96.4MB in the beginning and 93.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:01:24,510 INFO L158 Benchmark]: RCFGBuilder took 2687.53ms. Allocated memory was 169.9MB in the beginning and 226.5MB in the end (delta: 56.6MB). Free memory was 93.6MB in the beginning and 132.5MB in the end (delta: -38.9MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2023-11-06 22:01:24,510 INFO L158 Benchmark]: TraceAbstraction took 50863.19ms. Allocated memory was 226.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 131.5MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-11-06 22:01:24,511 INFO L158 Benchmark]: Witness Printer took 4.89ms. Allocated memory is still 6.6GB. Free memory is still 4.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:01:24,516 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.36ms. Allocated memory is still 169.9MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 898.21ms. Allocated memory is still 169.9MB. Free memory was 126.4MB in the beginning and 99.9MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.40ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 96.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.50ms. Allocated memory is still 169.9MB. Free memory was 96.4MB in the beginning and 93.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2687.53ms. Allocated memory was 169.9MB in the beginning and 226.5MB in the end (delta: 56.6MB). Free memory was 93.6MB in the beginning and 132.5MB in the end (delta: -38.9MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * TraceAbstraction took 50863.19ms. Allocated memory was 226.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 131.5MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 4.89ms. Allocated memory is still 6.6GB. Free memory is still 4.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.3s, 202 PlacesBefore, 101 PlacesAfterwards, 195 TransitionsBefore, 93 TransitionsAfterwards, 9868 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 156 TotalNumberOfCompositions, 67660 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15678, independent: 14697, independent conditional: 0, independent unconditional: 14697, dependent: 981, dependent conditional: 0, dependent unconditional: 981, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3742, independent: 3643, independent conditional: 0, independent unconditional: 3643, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15678, independent: 11054, independent conditional: 0, independent unconditional: 11054, dependent: 882, dependent conditional: 0, dependent unconditional: 882, unknown: 3742, unknown conditional: 0, unknown unconditional: 3742] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 422, Positive conditional cache size: 0, Positive unconditional cache size: 422, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2121; [L872] FCALL, FORK 0 pthread_create(&t2121, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2121, ((void *)0), P0, ((void *)0))=-1, t2121={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] [L873] 0 pthread_t t2122; [L874] FCALL, FORK 0 pthread_create(&t2122, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2122, ((void *)0), P1, ((void *)0))=0, t2121={6:0}, t2122={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] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 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=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, 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=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=0] [L801] 2 x$w_buff1 = x$w_buff0 [L802] 2 x$w_buff0 = 2 [L803] 2 x$w_buff1_used = x$w_buff0_used [L804] 2 x$w_buff0_used = (_Bool)1 [L805] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 2 !expression [L19] CALL 2 reach_error() [L18] COND FALSE 2 !(0) [L18] 2 __assert_fail ("0", "safe015_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) 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, 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=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=2, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x={3:0}, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 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: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 876]: 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: 874]: 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, 260 locations, 105 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: 50.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 27.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 0 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=0, InterpolantAutomatonStates: 11, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 57 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-06 22:01:24,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe015_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1568f4b0615eb98ed6bee584aeda19485d9df0ed08c84a8233a5817e939c5388 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:01:27,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:01:27,711 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:01:27,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:01:27,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:01:27,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:01:27,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:01:27,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:01:27,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:01:27,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:01:27,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:01:27,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:01:27,798 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:01:27,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:01:27,802 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:01:27,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:01:27,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:01:27,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:01:27,809 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:01:27,811 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:01:27,813 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:01:27,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:01:27,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:01:27,814 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:01:27,815 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:01:27,815 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:01:27,816 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:01:27,816 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:01:27,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:01:27,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:01:27,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:01:27,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:01:27,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:01:27,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:01:27,821 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:01:27,821 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:01:27,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:01:27,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:01:27,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:01:27,823 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:01:27,824 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:01:27,824 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_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1568f4b0615eb98ed6bee584aeda19485d9df0ed08c84a8233a5817e939c5388 [2023-11-06 22:01:28,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:01:28,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:01:28,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:01:28,388 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:01:28,388 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:01:28,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe015_power.oepc.i [2023-11-06 22:01:31,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:01:32,209 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:01:32,210 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/sv-benchmarks/c/pthread-wmm/safe015_power.oepc.i [2023-11-06 22:01:32,249 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/data/a55e346ee/ae74b1044d7942bda3678ca7e107f687/FLAG1fc085efa [2023-11-06 22:01:32,272 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/data/a55e346ee/ae74b1044d7942bda3678ca7e107f687 [2023-11-06 22:01:32,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:01:32,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:01:32,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:01:32,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:01:32,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:01:32,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:32" (1/1) ... [2023-11-06 22:01:32,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50461741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:32, skipping insertion in model container [2023-11-06 22:01:32,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:32" (1/1) ... [2023-11-06 22:01:32,371 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:01:32,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:01:32,975 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:01:33,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:01:33,110 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:01:33,111 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:01:33,120 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:01:33,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33 WrapperNode [2023-11-06 22:01:33,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:01:33,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:01:33,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:01:33,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:01:33,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,267 INFO L138 Inliner]: procedures = 180, calls = 87, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 237 [2023-11-06 22:01:33,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:01:33,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:01:33,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:01:33,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:01:33,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:01:33,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:01:33,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:01:33,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:01:33,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (1/1) ... [2023-11-06 22:01:33,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:01:33,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:01:33,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:01:33,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:01:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:01:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:01:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:01:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:01:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:01:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:01:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:01:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:01:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:01:33,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:01:33,467 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:01:33,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:01:33,469 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:01:33,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:01:33,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:01:33,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:01:33,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:01:33,471 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:01:33,745 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:01:33,749 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:01:34,997 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:01:36,517 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:01:36,518 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:01:36,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:36 BoogieIcfgContainer [2023-11-06 22:01:36,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:01:36,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:01:36,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:01:36,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:01:36,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:01:32" (1/3) ... [2023-11-06 22:01:36,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebb747a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:36, skipping insertion in model container [2023-11-06 22:01:36,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:33" (2/3) ... [2023-11-06 22:01:36,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebb747a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:36, skipping insertion in model container [2023-11-06 22:01:36,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:36" (3/3) ... [2023-11-06 22:01:36,539 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.oepc.i [2023-11-06 22:01:36,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:01:36,561 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-11-06 22:01:36,562 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:01:36,845 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:01:36,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 199 transitions, 410 flow [2023-11-06 22:01:37,130 INFO L124 PetriNetUnfolderBase]: 3/196 cut-off events. [2023-11-06 22:01:37,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:01:37,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 196 events. 3/196 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 376 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-11-06 22:01:37,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 199 transitions, 410 flow [2023-11-06 22:01:37,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 196 transitions, 401 flow [2023-11-06 22:01:37,162 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:01:37,183 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 196 transitions, 401 flow [2023-11-06 22:01:37,188 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 196 transitions, 401 flow [2023-11-06 22:01:37,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 196 transitions, 401 flow [2023-11-06 22:01:37,327 INFO L124 PetriNetUnfolderBase]: 3/196 cut-off events. [2023-11-06 22:01:37,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:01:37,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 196 events. 3/196 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 371 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-11-06 22:01:37,339 INFO L119 LiptonReduction]: Number of co-enabled transitions 9868 [2023-11-06 22:01:51,532 WARN L293 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 193 DAG size of output: 190 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 22:02:00,151 WARN L293 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 221 DAG size of output: 219 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 22:02:39,700 INFO L134 LiptonReduction]: Checked pairs total: 60793 [2023-11-06 22:02:39,701 INFO L136 LiptonReduction]: Total number of compositions: 165 [2023-11-06 22:02:39,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:02:39,723 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;@10b91bf1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:02:39,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2023-11-06 22:02:39,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:02:39,726 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:02:39,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:02:39,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:39,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:02:39,728 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-11-06 22:02:39,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1487, now seen corresponding path program 1 times [2023-11-06 22:02:39,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:02:39,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154716823] [2023-11-06 22:02:39,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:39,749 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-06 22:02:39,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:02:39,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:39,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:39,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:02:39,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:39,946 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-06 22:02:39,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:39,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:02:39,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154716823] [2023-11-06 22:02:39,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154716823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:39,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:02:39,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285479500] [2023-11-06 22:02:39,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:39,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:02:39,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:02:40,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:02:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:02:40,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 364 [2023-11-06 22:02:40,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 195 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 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-06 22:02:40,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:40,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 364 [2023-11-06 22:02:40,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:50,072 INFO L124 PetriNetUnfolderBase]: 27605/39102 cut-off events. [2023-11-06 22:02:50,073 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-06 22:02:50,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77635 conditions, 39102 events. 27605/39102 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 3027. Compared 272169 event pairs, 27605 based on Foata normal form. 0/16640 useless extension candidates. Maximal degree in co-relation 77624. Up to 38383 conditions per place. [2023-11-06 22:02:50,399 INFO L140 encePairwiseOnDemand]: 322/364 looper letters, 47 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-11-06 22:02:50,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 201 flow [2023-11-06 22:02:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:02:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:02:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2023-11-06 22:02:50,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739010989010989 [2023-11-06 22:02:50,427 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 345 transitions. [2023-11-06 22:02:50,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 345 transitions. [2023-11-06 22:02:50,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:50,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 345 transitions. [2023-11-06 22:02:50,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 172.5) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:50,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:50,452 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:50,455 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 195 flow. Second operand 2 states and 345 transitions. [2023-11-06 22:02:50,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 201 flow [2023-11-06 22:02:50,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:02:50,468 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-11-06 22:02:50,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-11-06 22:02:50,475 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -44 predicate places. [2023-11-06 22:02:50,476 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-11-06 22:02:50,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 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-06 22:02:50,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:50,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:02:50,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:50,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:50,697 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-11-06 22:02:50,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash 45611532, now seen corresponding path program 1 times [2023-11-06 22:02:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:02:50,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532576911] [2023-11-06 22:02:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:50,699 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-06 22:02:50,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:02:50,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:50,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:50,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:02:50,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:51,017 INFO L322 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-06 22:02:51,018 INFO L351 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-06 22:02:51,080 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-06 22:02:51,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:51,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:02:51,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532576911] [2023-11-06 22:02:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532576911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:51,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:51,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:02:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623239812] [2023-11-06 22:02:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:51,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:02:51,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:51,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:51,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 364 [2023-11-06 22:02:51,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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-06 22:02:51,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:51,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 364 [2023-11-06 22:02:51,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:56,245 INFO L124 PetriNetUnfolderBase]: 14577/20558 cut-off events. [2023-11-06 22:02:56,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:02:56,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41181 conditions, 20558 events. 14577/20558 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 127413 event pairs, 9313 based on Foata normal form. 0/10589 useless extension candidates. Maximal degree in co-relation 41178. Up to 11247 conditions per place. [2023-11-06 22:02:56,388 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 61 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-06 22:02:56,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 260 flow [2023-11-06 22:02:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:02:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-11-06 22:02:56,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40934065934065933 [2023-11-06 22:02:56,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-11-06 22:02:56,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-11-06 22:02:56,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:56,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-11-06 22:02:56,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 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-06 22:02:56,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 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-06 22:02:56,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 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-06 22:02:56,407 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 447 transitions. [2023-11-06 22:02:56,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 260 flow [2023-11-06 22:02:56,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:02:56,411 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 116 flow [2023-11-06 22:02:56,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=3, PETRI_FLOW=116, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-11-06 22:02:56,414 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -44 predicate places. [2023-11-06 22:02:56,414 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 116 flow [2023-11-06 22:02:56,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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-06 22:02:56,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:56,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:02:56,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:02:56,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:56,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-11-06 22:02:56,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash 45611533, now seen corresponding path program 1 times [2023-11-06 22:02:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:02:56,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782453477] [2023-11-06 22:02:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:56,631 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-06 22:02:56,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:02:56,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:56,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:56,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:02:56,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:56,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:02:56,820 INFO L351 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-06 22:02:56,864 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-06 22:02:56,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:56,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:02:56,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782453477] [2023-11-06 22:02:56,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782453477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:56,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:56,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:02:56,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667525197] [2023-11-06 22:02:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:56,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:56,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:02:56,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:56,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:56,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 364 [2023-11-06 22:02:56,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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-06 22:02:56,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:56,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 364 [2023-11-06 22:02:56,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:02:58,647 INFO L124 PetriNetUnfolderBase]: 4084/6046 cut-off events. [2023-11-06 22:02:58,648 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2023-11-06 22:02:58,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13056 conditions, 6046 events. 4084/6046 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 33963 event pairs, 4084 based on Foata normal form. 0/4641 useless extension candidates. Maximal degree in co-relation 13051. Up to 5910 conditions per place. [2023-11-06 22:02:58,719 INFO L140 encePairwiseOnDemand]: 354/364 looper letters, 34 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-11-06 22:02:58,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 168 flow [2023-11-06 22:02:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:02:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:02:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-11-06 22:02:58,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39194139194139194 [2023-11-06 22:02:58,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-11-06 22:02:58,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-11-06 22:02:58,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:02:58,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-11-06 22:02:58,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:02:58,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 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-06 22:02:58,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 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-06 22:02:58,735 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 116 flow. Second operand 3 states and 428 transitions. [2023-11-06 22:02:58,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 168 flow [2023-11-06 22:02:58,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:02:58,745 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 96 flow [2023-11-06 22:02:58,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-11-06 22:02:58,747 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -53 predicate places. [2023-11-06 22:02:58,747 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 96 flow [2023-11-06 22:02:58,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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-06 22:02:58,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:02:58,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:02:58,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:58,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:58,963 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-11-06 22:02:58,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:02:58,964 INFO L85 PathProgramCache]: Analyzing trace with hash 883837776, now seen corresponding path program 1 times [2023-11-06 22:02:58,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:02:58,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351386519] [2023-11-06 22:02:58,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:02:58,965 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-06 22:02:58,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:02:58,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:59,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:02:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:02:59,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:02:59,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:02:59,203 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-06 22:02:59,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:02:59,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:02:59,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351386519] [2023-11-06 22:02:59,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351386519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:02:59,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:02:59,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:02:59,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310496315] [2023-11-06 22:02:59,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:02:59,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:02:59,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:02:59,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:02:59,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:02:59,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 364 [2023-11-06 22:02:59,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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-06 22:02:59,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:02:59,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 364 [2023-11-06 22:02:59,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:00,951 INFO L124 PetriNetUnfolderBase]: 3539/5156 cut-off events. [2023-11-06 22:03:00,951 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-06 22:03:00,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11190 conditions, 5156 events. 3539/5156 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 29872 event pairs, 326 based on Foata normal form. 0/4126 useless extension candidates. Maximal degree in co-relation 11185. Up to 4569 conditions per place. [2023-11-06 22:03:00,993 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 54 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-06 22:03:00,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 261 flow [2023-11-06 22:03:00,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:03:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:03:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-06 22:03:00,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010989010989011 [2023-11-06 22:03:00,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-06 22:03:00,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-06 22:03:00,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:00,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-06 22:03:01,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:01,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 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-06 22:03:01,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 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-06 22:03:01,007 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 96 flow. Second operand 3 states and 438 transitions. [2023-11-06 22:03:01,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 261 flow [2023-11-06 22:03:01,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:03:01,010 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 97 flow [2023-11-06 22:03:01,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2023-11-06 22:03:01,011 INFO L281 CegarLoopForPetriNet]: 101 programPoint places, -53 predicate places. [2023-11-06 22:03:01,011 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 97 flow [2023-11-06 22:03:01,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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-06 22:03:01,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:01,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:01,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:03:01,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:03:01,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-11-06 22:03:01,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1629168562, now seen corresponding path program 1 times [2023-11-06 22:03:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:03:01,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860026427] [2023-11-06 22:03:01,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:01,229 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-06 22:03:01,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:03:01,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:03:01,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:03:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:03:01,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:03:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:03:01,554 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:03:01,554 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:03:01,556 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2023-11-06 22:03:01,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 105 remaining) [2023-11-06 22:03:01,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 105 remaining) [2023-11-06 22:03:01,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 105 remaining) [2023-11-06 22:03:01,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 105 remaining) [2023-11-06 22:03:01,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 105 remaining) [2023-11-06 22:03:01,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 105 remaining) [2023-11-06 22:03:01,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 105 remaining) [2023-11-06 22:03:01,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 105 remaining) [2023-11-06 22:03:01,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 105 remaining) [2023-11-06 22:03:01,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 105 remaining) [2023-11-06 22:03:01,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 105 remaining) [2023-11-06 22:03:01,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 105 remaining) [2023-11-06 22:03:01,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (91 of 105 remaining) [2023-11-06 22:03:01,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (90 of 105 remaining) [2023-11-06 22:03:01,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 105 remaining) [2023-11-06 22:03:01,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 105 remaining) [2023-11-06 22:03:01,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 105 remaining) [2023-11-06 22:03:01,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 105 remaining) [2023-11-06 22:03:01,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 105 remaining) [2023-11-06 22:03:01,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 105 remaining) [2023-11-06 22:03:01,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 105 remaining) [2023-11-06 22:03:01,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 105 remaining) [2023-11-06 22:03:01,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 105 remaining) [2023-11-06 22:03:01,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 105 remaining) [2023-11-06 22:03:01,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 105 remaining) [2023-11-06 22:03:01,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 105 remaining) [2023-11-06 22:03:01,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 105 remaining) [2023-11-06 22:03:01,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 105 remaining) [2023-11-06 22:03:01,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 105 remaining) [2023-11-06 22:03:01,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 105 remaining) [2023-11-06 22:03:01,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 105 remaining) [2023-11-06 22:03:01,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 105 remaining) [2023-11-06 22:03:01,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 105 remaining) [2023-11-06 22:03:01,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 105 remaining) [2023-11-06 22:03:01,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 105 remaining) [2023-11-06 22:03:01,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 105 remaining) [2023-11-06 22:03:01,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 105 remaining) [2023-11-06 22:03:01,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 105 remaining) [2023-11-06 22:03:01,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 105 remaining) [2023-11-06 22:03:01,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 105 remaining) [2023-11-06 22:03:01,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 105 remaining) [2023-11-06 22:03:01,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 105 remaining) [2023-11-06 22:03:01,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 105 remaining) [2023-11-06 22:03:01,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 105 remaining) [2023-11-06 22:03:01,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 105 remaining) [2023-11-06 22:03:01,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 105 remaining) [2023-11-06 22:03:01,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 105 remaining) [2023-11-06 22:03:01,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 105 remaining) [2023-11-06 22:03:01,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 105 remaining) [2023-11-06 22:03:01,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 105 remaining) [2023-11-06 22:03:01,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 105 remaining) [2023-11-06 22:03:01,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 105 remaining) [2023-11-06 22:03:01,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 105 remaining) [2023-11-06 22:03:01,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 105 remaining) [2023-11-06 22:03:01,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 105 remaining) [2023-11-06 22:03:01,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 105 remaining) [2023-11-06 22:03:01,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 105 remaining) [2023-11-06 22:03:01,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 105 remaining) [2023-11-06 22:03:01,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 105 remaining) [2023-11-06 22:03:01,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 105 remaining) [2023-11-06 22:03:01,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 105 remaining) [2023-11-06 22:03:01,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 105 remaining) [2023-11-06 22:03:01,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (41 of 105 remaining) [2023-11-06 22:03:01,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (40 of 105 remaining) [2023-11-06 22:03:01,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 105 remaining) [2023-11-06 22:03:01,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 105 remaining) [2023-11-06 22:03:01,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 105 remaining) [2023-11-06 22:03:01,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 105 remaining) [2023-11-06 22:03:01,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 105 remaining) [2023-11-06 22:03:01,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 105 remaining) [2023-11-06 22:03:01,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 105 remaining) [2023-11-06 22:03:01,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 105 remaining) [2023-11-06 22:03:01,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 105 remaining) [2023-11-06 22:03:01,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 105 remaining) [2023-11-06 22:03:01,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 105 remaining) [2023-11-06 22:03:01,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 105 remaining) [2023-11-06 22:03:01,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 105 remaining) [2023-11-06 22:03:01,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 105 remaining) [2023-11-06 22:03:01,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 105 remaining) [2023-11-06 22:03:01,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 105 remaining) [2023-11-06 22:03:01,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 105 remaining) [2023-11-06 22:03:01,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 105 remaining) [2023-11-06 22:03:01,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 105 remaining) [2023-11-06 22:03:01,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 105 remaining) [2023-11-06 22:03:01,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 105 remaining) [2023-11-06 22:03:01,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 105 remaining) [2023-11-06 22:03:01,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 105 remaining) [2023-11-06 22:03:01,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 105 remaining) [2023-11-06 22:03:01,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 105 remaining) [2023-11-06 22:03:01,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 105 remaining) [2023-11-06 22:03:01,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 105 remaining) [2023-11-06 22:03:01,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 105 remaining) [2023-11-06 22:03:01,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 105 remaining) [2023-11-06 22:03:01,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 105 remaining) [2023-11-06 22:03:01,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 105 remaining) [2023-11-06 22:03:01,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 105 remaining) [2023-11-06 22:03:01,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 105 remaining) [2023-11-06 22:03:01,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 105 remaining) [2023-11-06 22:03:01,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 105 remaining) [2023-11-06 22:03:01,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 105 remaining) [2023-11-06 22:03:01,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 105 remaining) [2023-11-06 22:03:01,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 105 remaining) [2023-11-06 22:03:01,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 105 remaining) [2023-11-06 22:03:01,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 105 remaining) [2023-11-06 22:03:01,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:03:01,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:03:01,812 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:03:01,820 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:03:01,820 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:03:01,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:03:01 BasicIcfg [2023-11-06 22:03:01,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:03:01,916 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:03:01,916 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:03:01,917 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:03:01,923 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:36" (3/4) ... [2023-11-06 22:03:01,925 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:03:01,926 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:03:01,928 INFO L158 Benchmark]: Toolchain (without parser) took 89650.25ms. Allocated memory was 90.2MB in the beginning and 6.3GB in the end (delta: 6.3GB). Free memory was 66.5MB in the beginning and 5.4GB in the end (delta: -5.4GB). Peak memory consumption was 885.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:01,928 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 90.2MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:03:01,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 842.40ms. Allocated memory is still 90.2MB. Free memory was 66.2MB in the beginning and 39.3MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:03:01,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.72ms. Allocated memory is still 90.2MB. Free memory was 39.3MB in the beginning and 66.6MB in the end (delta: -27.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:01,932 INFO L158 Benchmark]: Boogie Preprocessor took 96.09ms. Allocated memory is still 90.2MB. Free memory was 66.6MB in the beginning and 63.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:03:01,934 INFO L158 Benchmark]: RCFGBuilder took 3158.89ms. Allocated memory was 90.2MB in the beginning and 155.2MB in the end (delta: 65.0MB). Free memory was 63.7MB in the beginning and 112.7MB in the end (delta: -49.0MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. [2023-11-06 22:03:01,935 INFO L158 Benchmark]: TraceAbstraction took 85387.77ms. Allocated memory was 155.2MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 112.7MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 864.2MB. Max. memory is 16.1GB. [2023-11-06 22:03:01,935 INFO L158 Benchmark]: Witness Printer took 10.27ms. Allocated memory is still 6.3GB. Free memory is still 5.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:03:01,941 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.37ms. Allocated memory is still 90.2MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 842.40ms. Allocated memory is still 90.2MB. Free memory was 66.2MB in the beginning and 39.3MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.72ms. Allocated memory is still 90.2MB. Free memory was 39.3MB in the beginning and 66.6MB in the end (delta: -27.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.09ms. Allocated memory is still 90.2MB. Free memory was 66.6MB in the beginning and 63.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 3158.89ms. Allocated memory was 90.2MB in the beginning and 155.2MB in the end (delta: 65.0MB). Free memory was 63.7MB in the beginning and 112.7MB in the end (delta: -49.0MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. * TraceAbstraction took 85387.77ms. Allocated memory was 155.2MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 112.7MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 864.2MB. Max. memory is 16.1GB. * Witness Printer took 10.27ms. Allocated memory is still 6.3GB. Free memory is still 5.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.5s, 203 PlacesBefore, 101 PlacesAfterwards, 196 TransitionsBefore, 93 TransitionsAfterwards, 9868 CoEnabledTransitionPairs, 7 FixpointIterations, 65 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 165 TotalNumberOfCompositions, 60793 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13772, independent: 12907, independent conditional: 0, independent unconditional: 12907, dependent: 865, dependent conditional: 0, dependent unconditional: 865, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3673, independent: 3563, independent conditional: 0, independent unconditional: 3563, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13772, independent: 9344, independent conditional: 0, independent unconditional: 9344, dependent: 755, dependent conditional: 0, dependent unconditional: 755, unknown: 3673, unknown conditional: 0, unknown unconditional: 3673] , Statistics on independence cache: Total cache size (in pairs): 476, Positive cache size: 408, Positive conditional cache size: 0, Positive unconditional cache size: 408, Negative cache size: 68, Negative conditional cache size: 0, Negative unconditional cache size: 68, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2121; [L872] FCALL, FORK 0 pthread_create(&t2121, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2121, ((void *)0), P0, ((void *)0))=-1, t2121={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] [L873] 0 pthread_t t2122; [L874] FCALL, FORK 0 pthread_create(&t2122, ((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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2122, ((void *)0), P1, ((void *)0))=0, t2121={7:0}, t2122={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] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 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=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, 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=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=0] [L801] 2 x$w_buff1 = x$w_buff0 [L802] 2 x$w_buff0 = 2 [L803] 2 x$w_buff1_used = x$w_buff0_used [L804] 2 x$w_buff0_used = (_Bool)1 [L805] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 2 !expression [L19] CALL 2 reach_error() [L18] COND FALSE 2 !(0) [L18] 2 __assert_fail ("0", "safe015_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) 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, 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=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=2, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x={3:0}, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 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: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 876]: 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: 874]: 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, 261 locations, 105 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: 84.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 62.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 3 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=0, InterpolantAutomatonStates: 11, 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.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 SizeOfPredicates, 2 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-06 22:03:01,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6793b0-9788-4196-a87e-53f7d4993526/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample