./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.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_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:03:12,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:03:12,592 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:03:12,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:03:12,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:03:12,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:03:12,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:03:12,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:03:12,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:03:12,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:03:12,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:03:12,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:03:12,662 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:03:12,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:03:12,664 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:03:12,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:03:12,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:03:12,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:03:12,666 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:03:12,667 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:03:12,667 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:03:12,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:03:12,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:03:12,669 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:03:12,669 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:03:12,670 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:03:12,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:03:12,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:03:12,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:03:12,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:12,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:03:12,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:03:12,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:03:12,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:03:12,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:03:12,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:03:12,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:03:12,676 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:03:12,676 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_6c71e655-3cfa-4728-b9ed-5e96fda30843/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_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2023-11-06 23:03:13,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:03:13,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:03:13,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:03:13,082 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:03:13,083 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:03:13,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 23:03:16,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:03:16,626 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:03:16,631 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 23:03:16,661 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/data/a34603a19/8f396124f40444e4b8833b64463dcb26/FLAGf20020825 [2023-11-06 23:03:16,681 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/data/a34603a19/8f396124f40444e4b8833b64463dcb26 [2023-11-06 23:03:16,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:03:16,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:03:16,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:16,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:03:16,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:03:16,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202154b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16, skipping insertion in model container [2023-11-06 23:03:16,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,758 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:03:17,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:17,202 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:03:17,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:17,388 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:03:17,389 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:03:17,398 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:03:17,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17 WrapperNode [2023-11-06 23:03:17,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:17,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:17,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:03:17,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:03:17,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,514 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-11-06 23:03:17,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:17,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:03:17,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:03:17,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:03:17,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:03:17,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:03:17,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:03:17,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:03:17,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (1/1) ... [2023-11-06 23:03:17,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:17,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:17,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:03:17,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:03:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:03:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:03:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:03:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:03:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:03:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:03:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:03:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:03:17,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:03:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:03:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:03:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:03:17,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:03:17,697 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 23:03:17,869 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:03:17,873 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:03:18,245 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:03:18,499 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:03:18,500 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:03:18,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:18 BoogieIcfgContainer [2023-11-06 23:03:18,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:03:18,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:03:18,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:03:18,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:03:18,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:03:16" (1/3) ... [2023-11-06 23:03:18,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9a1c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:18, skipping insertion in model container [2023-11-06 23:03:18,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:17" (2/3) ... [2023-11-06 23:03:18,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9a1c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:18, skipping insertion in model container [2023-11-06 23:03:18,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:18" (3/3) ... [2023-11-06 23:03:18,520 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 23:03:18,544 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:03:18,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-06 23:03:18,546 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:03:18,631 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:03:18,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 102 transitions, 212 flow [2023-11-06 23:03:18,738 INFO L124 PetriNetUnfolderBase]: 3/100 cut-off events. [2023-11-06 23:03:18,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:18,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 100 events. 3/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-11-06 23:03:18,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 102 transitions, 212 flow [2023-11-06 23:03:18,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 100 transitions, 206 flow [2023-11-06 23:03:18,754 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:03:18,769 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 100 transitions, 206 flow [2023-11-06 23:03:18,772 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 100 transitions, 206 flow [2023-11-06 23:03:18,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 100 transitions, 206 flow [2023-11-06 23:03:18,818 INFO L124 PetriNetUnfolderBase]: 3/100 cut-off events. [2023-11-06 23:03:18,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:18,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 100 events. 3/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-11-06 23:03:18,826 INFO L119 LiptonReduction]: Number of co-enabled transitions 1426 [2023-11-06 23:03:25,744 INFO L134 LiptonReduction]: Checked pairs total: 3909 [2023-11-06 23:03:25,744 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-11-06 23:03:25,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:03:25,795 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;@94b1f9c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:03:25,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-06 23:03:25,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:03:25,799 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:03:25,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:25,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:25,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:03:25,801 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:25,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:25,807 INFO L85 PathProgramCache]: Analyzing trace with hash 486, now seen corresponding path program 1 times [2023-11-06 23:03:25,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122900080] [2023-11-06 23:03:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:25,993 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 23:03:25,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122900080] [2023-11-06 23:03:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122900080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:03:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580589346] [2023-11-06 23:03:25,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:26,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:03:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:26,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:03:26,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:03:26,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 214 [2023-11-06 23:03:26,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 23:03:26,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:26,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 214 [2023-11-06 23:03:26,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:26,258 INFO L124 PetriNetUnfolderBase]: 175/312 cut-off events. [2023-11-06 23:03:26,258 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 23:03:26,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 312 events. 175/312 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1270 event pairs, 175 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 624. Up to 307 conditions per place. [2023-11-06 23:03:26,264 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-11-06 23:03:26,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 74 flow [2023-11-06 23:03:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:03:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:03:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2023-11-06 23:03:26,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672897196261682 [2023-11-06 23:03:26,282 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 200 transitions. [2023-11-06 23:03:26,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 200 transitions. [2023-11-06 23:03:26,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:26,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 200 transitions. [2023-11-06 23:03:26,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 23:03:26,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:26,299 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:26,301 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 2 states and 200 transitions. [2023-11-06 23:03:26,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 74 flow [2023-11-06 23:03:26,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:26,306 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-11-06 23:03:26,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-11-06 23:03:26,313 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-11-06 23:03:26,314 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-11-06 23:03:26,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 23:03:26,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:26,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 23:03:26,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:03:26,316 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:26,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash 477218, now seen corresponding path program 1 times [2023-11-06 23:03:26,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:26,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572506120] [2023-11-06 23:03:26,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:26,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,729 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 23:03:26,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:26,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572506120] [2023-11-06 23:03:26,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572506120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:26,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:26,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:03:26,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927412578] [2023-11-06 23:03:26,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:26,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:26,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:26,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:26,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:26,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 214 [2023-11-06 23:03:26,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 23:03:26,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:26,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 214 [2023-11-06 23:03:26,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:26,880 INFO L124 PetriNetUnfolderBase]: 135/255 cut-off events. [2023-11-06 23:03:26,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:26,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 255 events. 135/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1015 event pairs, 39 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 505. Up to 199 conditions per place. [2023-11-06 23:03:26,883 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 21 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2023-11-06 23:03:26,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 27 transitions, 110 flow [2023-11-06 23:03:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-11-06 23:03:26,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45638629283489096 [2023-11-06 23:03:26,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-11-06 23:03:26,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-11-06 23:03:26,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:26,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-11-06 23:03:26,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 23:03:26,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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 23:03:26,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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 23:03:26,894 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 293 transitions. [2023-11-06 23:03:26,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 27 transitions, 110 flow [2023-11-06 23:03:26,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:03:26,895 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-11-06 23:03:26,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-11-06 23:03:26,897 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-11-06 23:03:26,897 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-11-06 23:03:26,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 23:03:26,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:26,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:26,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:03:26,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:26,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1602989915, now seen corresponding path program 1 times [2023-11-06 23:03:26,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:26,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689260127] [2023-11-06 23:03:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:26,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,209 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 23:03:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:27,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689260127] [2023-11-06 23:03:27,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689260127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:27,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:27,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:03:27,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454395069] [2023-11-06 23:03:27,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:27,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:27,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:27,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:27,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 214 [2023-11-06 23:03:27,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 23:03:27,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:27,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 214 [2023-11-06 23:03:27,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:27,336 INFO L124 PetriNetUnfolderBase]: 140/269 cut-off events. [2023-11-06 23:03:27,336 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-06 23:03:27,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 269 events. 140/269 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1028 event pairs, 50 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 552. Up to 232 conditions per place. [2023-11-06 23:03:27,342 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-11-06 23:03:27,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 106 flow [2023-11-06 23:03:27,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2023-11-06 23:03:27,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4439252336448598 [2023-11-06 23:03:27,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2023-11-06 23:03:27,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2023-11-06 23:03:27,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:27,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2023-11-06 23:03:27,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 23:03:27,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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 23:03:27,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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 23:03:27,353 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 3 states and 285 transitions. [2023-11-06 23:03:27,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 106 flow [2023-11-06 23:03:27,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:27,355 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 55 flow [2023-11-06 23:03:27,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2023-11-06 23:03:27,357 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-11-06 23:03:27,357 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 55 flow [2023-11-06 23:03:27,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 23:03:27,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:27,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:27,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:03:27,363 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:27,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1602989896, now seen corresponding path program 1 times [2023-11-06 23:03:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020484995] [2023-11-06 23:03:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,746 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 23:03:27,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020484995] [2023-11-06 23:03:27,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020484995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:27,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:27,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:03:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472434990] [2023-11-06 23:03:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:27,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:27,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:27,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 214 [2023-11-06 23:03:27,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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 23:03:27,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:27,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 214 [2023-11-06 23:03:27,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:27,930 INFO L124 PetriNetUnfolderBase]: 97/190 cut-off events. [2023-11-06 23:03:27,930 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-06 23:03:27,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 190 events. 97/190 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 675 event pairs, 75 based on Foata normal form. 19/205 useless extension candidates. Maximal degree in co-relation 426. Up to 172 conditions per place. [2023-11-06 23:03:27,932 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 15 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-11-06 23:03:27,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 20 transitions, 93 flow [2023-11-06 23:03:27,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:03:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-11-06 23:03:27,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38434579439252337 [2023-11-06 23:03:27,935 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-11-06 23:03:27,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-11-06 23:03:27,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:27,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-11-06 23:03:27,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 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 23:03:27,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 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 23:03:27,941 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 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 23:03:27,942 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 55 flow. Second operand 4 states and 329 transitions. [2023-11-06 23:03:27,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 20 transitions, 93 flow [2023-11-06 23:03:27,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:03:27,944 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 54 flow [2023-11-06 23:03:27,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-11-06 23:03:27,945 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2023-11-06 23:03:27,945 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 54 flow [2023-11-06 23:03:27,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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 23:03:27,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:27,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:27,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:03:27,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:27,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:27,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1846871523, now seen corresponding path program 1 times [2023-11-06 23:03:27,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:27,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951615488] [2023-11-06 23:03:27,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:27,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:28,466 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 23:03:28,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:28,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951615488] [2023-11-06 23:03:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951615488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:28,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868637422] [2023-11-06 23:03:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:28,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:28,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:28,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:28,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 214 [2023-11-06 23:03:28,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 0 states have call successors, (0), 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 23:03:28,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:28,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 214 [2023-11-06 23:03:28,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:28,592 INFO L124 PetriNetUnfolderBase]: 125/233 cut-off events. [2023-11-06 23:03:28,593 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-06 23:03:28,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 233 events. 125/233 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 777 event pairs, 53 based on Foata normal form. 1/234 useless extension candidates. Maximal degree in co-relation 522. Up to 211 conditions per place. [2023-11-06 23:03:28,595 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 19 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-11-06 23:03:28,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 118 flow [2023-11-06 23:03:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-11-06 23:03:28,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4221183800623053 [2023-11-06 23:03:28,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-11-06 23:03:28,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-11-06 23:03:28,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:28,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-11-06 23:03:28,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 23:03:28,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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 23:03:28,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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 23:03:28,603 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 54 flow. Second operand 3 states and 271 transitions. [2023-11-06 23:03:28,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 118 flow [2023-11-06 23:03:28,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:28,605 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 70 flow [2023-11-06 23:03:28,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-11-06 23:03:28,607 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2023-11-06 23:03:28,607 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 70 flow [2023-11-06 23:03:28,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 0 states have call successors, (0), 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 23:03:28,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:28,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:28,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:03:28,608 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:28,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1419901138, now seen corresponding path program 1 times [2023-11-06 23:03:28,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:28,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338306870] [2023-11-06 23:03:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,513 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 23:03:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:29,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338306870] [2023-11-06 23:03:29,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338306870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:29,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:29,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:03:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463667158] [2023-11-06 23:03:29,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:29,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:29,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:29,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:29,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:29,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 214 [2023-11-06 23:03:29,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 23:03:29,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:29,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 214 [2023-11-06 23:03:29,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:29,687 INFO L124 PetriNetUnfolderBase]: 136/257 cut-off events. [2023-11-06 23:03:29,687 INFO L125 PetriNetUnfolderBase]: For 94/95 co-relation queries the response was YES. [2023-11-06 23:03:29,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 257 events. 136/257 cut-off events. For 94/95 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 959 event pairs, 50 based on Foata normal form. 5/261 useless extension candidates. Maximal degree in co-relation 646. Up to 208 conditions per place. [2023-11-06 23:03:29,691 INFO L140 encePairwiseOnDemand]: 206/214 looper letters, 18 selfloop transitions, 9 changer transitions 0/29 dead transitions. [2023-11-06 23:03:29,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 29 transitions, 154 flow [2023-11-06 23:03:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-11-06 23:03:29,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252336448598131 [2023-11-06 23:03:29,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-11-06 23:03:29,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-11-06 23:03:29,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:29,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-11-06 23:03:29,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 23:03:29,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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 23:03:29,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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 23:03:29,699 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 70 flow. Second operand 3 states and 273 transitions. [2023-11-06 23:03:29,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 29 transitions, 154 flow [2023-11-06 23:03:29,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:03:29,703 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 126 flow [2023-11-06 23:03:29,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-11-06 23:03:29,706 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-11-06 23:03:29,707 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 126 flow [2023-11-06 23:03:29,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 23:03:29,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:29,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:29,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:03:29,709 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:29,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:29,710 INFO L85 PathProgramCache]: Analyzing trace with hash -375865582, now seen corresponding path program 2 times [2023-11-06 23:03:29,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:29,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677760211] [2023-11-06 23:03:29,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:29,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,541 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 23:03:30,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:30,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677760211] [2023-11-06 23:03:30,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677760211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:30,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:30,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:30,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572605775] [2023-11-06 23:03:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:30,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:30,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:30,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:30,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:30,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 214 [2023-11-06 23:03:30,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:30,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:30,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 214 [2023-11-06 23:03:30,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:30,755 INFO L124 PetriNetUnfolderBase]: 155/305 cut-off events. [2023-11-06 23:03:30,755 INFO L125 PetriNetUnfolderBase]: For 279/299 co-relation queries the response was YES. [2023-11-06 23:03:30,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 305 events. 155/305 cut-off events. For 279/299 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1328 event pairs, 28 based on Foata normal form. 14/315 useless extension candidates. Maximal degree in co-relation 931. Up to 157 conditions per place. [2023-11-06 23:03:30,758 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 27 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2023-11-06 23:03:30,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 235 flow [2023-11-06 23:03:30,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:03:30,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-11-06 23:03:30,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42289719626168226 [2023-11-06 23:03:30,761 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-11-06 23:03:30,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-11-06 23:03:30,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:30,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-11-06 23:03:30,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 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 23:03:30,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 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 23:03:30,766 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 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 23:03:30,766 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 126 flow. Second operand 4 states and 362 transitions. [2023-11-06 23:03:30,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 235 flow [2023-11-06 23:03:30,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:03:30,770 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 149 flow [2023-11-06 23:03:30,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2023-11-06 23:03:30,771 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2023-11-06 23:03:30,771 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 149 flow [2023-11-06 23:03:30,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:30,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:30,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:30,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:03:30,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:30,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1418125582, now seen corresponding path program 1 times [2023-11-06 23:03:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238732616] [2023-11-06 23:03:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:30,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:31,280 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 23:03:31,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:31,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238732616] [2023-11-06 23:03:31,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238732616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:31,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:31,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:31,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971475152] [2023-11-06 23:03:31,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:31,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:31,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:31,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:31,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:31,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 214 [2023-11-06 23:03:31,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 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 23:03:31,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:31,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 214 [2023-11-06 23:03:31,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:31,532 INFO L124 PetriNetUnfolderBase]: 166/323 cut-off events. [2023-11-06 23:03:31,532 INFO L125 PetriNetUnfolderBase]: For 343/350 co-relation queries the response was YES. [2023-11-06 23:03:31,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 323 events. 166/323 cut-off events. For 343/350 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1323 event pairs, 40 based on Foata normal form. 12/331 useless extension candidates. Maximal degree in co-relation 992. Up to 223 conditions per place. [2023-11-06 23:03:31,536 INFO L140 encePairwiseOnDemand]: 207/214 looper letters, 30 selfloop transitions, 11 changer transitions 5/48 dead transitions. [2023-11-06 23:03:31,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 328 flow [2023-11-06 23:03:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:03:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:03:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2023-11-06 23:03:31,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41869158878504675 [2023-11-06 23:03:31,539 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 448 transitions. [2023-11-06 23:03:31,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 448 transitions. [2023-11-06 23:03:31,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:31,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 448 transitions. [2023-11-06 23:03:31,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 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 23:03:31,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 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 23:03:31,545 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 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 23:03:31,546 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 149 flow. Second operand 5 states and 448 transitions. [2023-11-06 23:03:31,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 328 flow [2023-11-06 23:03:31,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 313 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-06 23:03:31,554 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 213 flow [2023-11-06 23:03:31,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-11-06 23:03:31,558 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2023-11-06 23:03:31,559 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 213 flow [2023-11-06 23:03:31,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 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 23:03:31,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:31,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:31,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:03:31,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:31,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1357932565, now seen corresponding path program 1 times [2023-11-06 23:03:31,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:31,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971716317] [2023-11-06 23:03:31,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:31,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:31,813 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 23:03:31,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:31,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971716317] [2023-11-06 23:03:31,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971716317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:31,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222042942] [2023-11-06 23:03:31,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:31,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:31,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:31,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:31,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:31,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 214 [2023-11-06 23:03:31,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 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 23:03:31,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:31,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 214 [2023-11-06 23:03:31,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:31,968 INFO L124 PetriNetUnfolderBase]: 80/195 cut-off events. [2023-11-06 23:03:31,969 INFO L125 PetriNetUnfolderBase]: For 469/483 co-relation queries the response was YES. [2023-11-06 23:03:31,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 195 events. 80/195 cut-off events. For 469/483 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 865 event pairs, 10 based on Foata normal form. 52/245 useless extension candidates. Maximal degree in co-relation 704. Up to 94 conditions per place. [2023-11-06 23:03:31,971 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 26 selfloop transitions, 3 changer transitions 29/62 dead transitions. [2023-11-06 23:03:31,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 496 flow [2023-11-06 23:03:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:03:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:03:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2023-11-06 23:03:31,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4308411214953271 [2023-11-06 23:03:31,975 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2023-11-06 23:03:31,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2023-11-06 23:03:31,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:31,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2023-11-06 23:03:31,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 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 23:03:31,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 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 23:03:31,982 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 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 23:03:31,982 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 213 flow. Second operand 5 states and 461 transitions. [2023-11-06 23:03:31,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 496 flow [2023-11-06 23:03:31,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 62 transitions, 472 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:31,988 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 190 flow [2023-11-06 23:03:31,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-11-06 23:03:31,989 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2023-11-06 23:03:31,990 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 190 flow [2023-11-06 23:03:31,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 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 23:03:31,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:31,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:31,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:03:31,991 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:31,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash 756609566, now seen corresponding path program 1 times [2023-11-06 23:03:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682264744] [2023-11-06 23:03:31,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:32,168 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 23:03:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682264744] [2023-11-06 23:03:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682264744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123463774] [2023-11-06 23:03:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:32,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:32,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:32,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:32,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 214 [2023-11-06 23:03:32,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 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 23:03:32,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:32,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 214 [2023-11-06 23:03:32,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:32,321 INFO L124 PetriNetUnfolderBase]: 30/93 cut-off events. [2023-11-06 23:03:32,321 INFO L125 PetriNetUnfolderBase]: For 231/236 co-relation queries the response was YES. [2023-11-06 23:03:32,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 93 events. 30/93 cut-off events. For 231/236 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 311 event pairs, 4 based on Foata normal form. 17/109 useless extension candidates. Maximal degree in co-relation 372. Up to 37 conditions per place. [2023-11-06 23:03:32,322 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 19 selfloop transitions, 5 changer transitions 19/45 dead transitions. [2023-11-06 23:03:32,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 367 flow [2023-11-06 23:03:32,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:03:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:03:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2023-11-06 23:03:32,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4205607476635514 [2023-11-06 23:03:32,326 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2023-11-06 23:03:32,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2023-11-06 23:03:32,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:32,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2023-11-06 23:03:32,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:32,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 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 23:03:32,332 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 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 23:03:32,332 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 190 flow. Second operand 6 states and 540 transitions. [2023-11-06 23:03:32,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 367 flow [2023-11-06 23:03:32,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 331 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-11-06 23:03:32,336 INFO L231 Difference]: Finished difference. Result has 45 places, 21 transitions, 135 flow [2023-11-06 23:03:32,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=21} [2023-11-06 23:03:32,337 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2023-11-06 23:03:32,337 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 21 transitions, 135 flow [2023-11-06 23:03:32,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 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 23:03:32,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:32,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:32,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:03:32,338 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:32,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:32,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1137178237, now seen corresponding path program 1 times [2023-11-06 23:03:32,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:32,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500245525] [2023-11-06 23:03:32,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:32,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:33,376 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 23:03:33,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:33,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500245525] [2023-11-06 23:03:33,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500245525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:33,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:33,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:03:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658549252] [2023-11-06 23:03:33,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:33,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:03:33,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:03:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:03:33,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 214 [2023-11-06 23:03:33,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 21 transitions, 135 flow. Second operand has 8 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:33,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:33,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 214 [2023-11-06 23:03:33,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:33,627 INFO L124 PetriNetUnfolderBase]: 15/54 cut-off events. [2023-11-06 23:03:33,627 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-11-06 23:03:33,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 54 events. 15/54 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 2 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 223. Up to 21 conditions per place. [2023-11-06 23:03:33,628 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 17 selfloop transitions, 3 changer transitions 15/36 dead transitions. [2023-11-06 23:03:33,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 293 flow [2023-11-06 23:03:33,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:03:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 617 transitions. [2023-11-06 23:03:33,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41188251001335113 [2023-11-06 23:03:33,632 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 617 transitions. [2023-11-06 23:03:33,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 617 transitions. [2023-11-06 23:03:33,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:33,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 617 transitions. [2023-11-06 23:03:33,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 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 23:03:33,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 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 23:03:33,641 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 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 23:03:33,642 INFO L175 Difference]: Start difference. First operand has 45 places, 21 transitions, 135 flow. Second operand 7 states and 617 transitions. [2023-11-06 23:03:33,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 293 flow [2023-11-06 23:03:33,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 238 flow, removed 15 selfloop flow, removed 11 redundant places. [2023-11-06 23:03:33,644 INFO L231 Difference]: Finished difference. Result has 40 places, 19 transitions, 103 flow [2023-11-06 23:03:33,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103, PETRI_PLACES=40, PETRI_TRANSITIONS=19} [2023-11-06 23:03:33,645 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2023-11-06 23:03:33,645 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 19 transitions, 103 flow [2023-11-06 23:03:33,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:33,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:33,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:33,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:03:33,647 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:33,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1525101861, now seen corresponding path program 2 times [2023-11-06 23:03:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:33,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069538710] [2023-11-06 23:03:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:03:33,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:03:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:03:33,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:03:33,788 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:03:33,789 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-06 23:03:33,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-06 23:03:33,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-06 23:03:33,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-06 23:03:33,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-06 23:03:33,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-06 23:03:33,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-06 23:03:33,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-06 23:03:33,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-06 23:03:33,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-06 23:03:33,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:03:33,794 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:33,801 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:03:33,801 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:03:33,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:03:33 BasicIcfg [2023-11-06 23:03:33,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:03:33,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:03:33,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:03:33,894 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:03:33,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:18" (3/4) ... [2023-11-06 23:03:33,896 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:03:33,898 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:03:33,898 INFO L158 Benchmark]: Toolchain (without parser) took 17208.06ms. Allocated memory was 132.1MB in the beginning and 239.1MB in the end (delta: 107.0MB). Free memory was 86.3MB in the beginning and 95.2MB in the end (delta: -8.9MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2023-11-06 23:03:33,899 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 132.1MB. Free memory was 103.8MB in the beginning and 103.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:03:33,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.81ms. Allocated memory is still 132.1MB. Free memory was 86.3MB in the beginning and 63.7MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 23:03:33,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.68ms. Allocated memory is still 132.1MB. Free memory was 63.7MB in the beginning and 61.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:03:33,900 INFO L158 Benchmark]: Boogie Preprocessor took 78.36ms. Allocated memory is still 132.1MB. Free memory was 61.2MB in the beginning and 59.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:03:33,900 INFO L158 Benchmark]: RCFGBuilder took 906.90ms. Allocated memory was 132.1MB in the beginning and 165.7MB in the end (delta: 33.6MB). Free memory was 59.1MB in the beginning and 112.7MB in the end (delta: -53.7MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-11-06 23:03:33,901 INFO L158 Benchmark]: TraceAbstraction took 15385.23ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 111.6MB in the beginning and 95.2MB in the end (delta: 16.4MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2023-11-06 23:03:33,901 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 239.1MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:03:33,904 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 132.1MB. Free memory was 103.8MB in the beginning and 103.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 707.81ms. Allocated memory is still 132.1MB. Free memory was 86.3MB in the beginning and 63.7MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.68ms. Allocated memory is still 132.1MB. Free memory was 63.7MB in the beginning and 61.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.36ms. Allocated memory is still 132.1MB. Free memory was 61.2MB in the beginning and 59.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 906.90ms. Allocated memory was 132.1MB in the beginning and 165.7MB in the end (delta: 33.6MB). Free memory was 59.1MB in the beginning and 112.7MB in the end (delta: -53.7MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15385.23ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 111.6MB in the beginning and 95.2MB in the end (delta: 16.4MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 239.1MB. Free memory is still 95.2MB. 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: 7.0s, 104 PlacesBefore, 29 PlacesAfterwards, 100 TransitionsBefore, 22 TransitionsAfterwards, 1426 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 112 TotalNumberOfCompositions, 3909 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1795, independent: 1648, independent conditional: 0, independent unconditional: 1648, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 790, independent: 757, independent conditional: 0, independent unconditional: 757, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1795, independent: 891, independent conditional: 0, independent unconditional: 891, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 790, unknown conditional: 0, unknown unconditional: 790] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=0, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=1, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: 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: 788]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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 5 procedures, 119 locations, 10 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: 15.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 671 IncrementalHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 32 mSDtfsCounter, 671 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=8, InterpolantAutomatonStates: 45, 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.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 906 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 23:03:33,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:03:36,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:03:36,883 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 23:03:36,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:03:36,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:03:36,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:03:36,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:03:36,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:03:36,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:03:36,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:03:36,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:03:36,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:03:36,943 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:03:36,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:03:36,944 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:03:36,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:03:36,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:03:36,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:03:36,947 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:03:36,948 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:03:36,948 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:03:36,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:03:36,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:03:36,959 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:03:36,959 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:03:36,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:03:36,960 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:03:36,960 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:03:36,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:03:36,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:03:36,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:03:36,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:36,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:03:36,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:03:36,965 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:03:36,965 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:03:36,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:03:36,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:03:36,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:03:36,967 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:03:36,968 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:03:36,968 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_6c71e655-3cfa-4728-b9ed-5e96fda30843/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_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2023-11-06 23:03:37,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:03:37,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:03:37,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:03:37,469 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:03:37,470 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:03:37,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 23:03:40,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:03:41,063 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:03:41,064 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 23:03:41,100 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/data/04cb97ea4/f9dcbb1b1d1d47b7bff4e227ea1baaf0/FLAGd0d890983 [2023-11-06 23:03:41,116 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/data/04cb97ea4/f9dcbb1b1d1d47b7bff4e227ea1baaf0 [2023-11-06 23:03:41,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:03:41,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:03:41,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:41,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:03:41,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:03:41,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10de598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41, skipping insertion in model container [2023-11-06 23:03:41,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,214 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:03:41,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:41,708 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:03:41,769 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:41,813 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:03:41,813 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:03:41,821 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:03:41,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41 WrapperNode [2023-11-06 23:03:41,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:41,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:41,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:03:41,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:03:41,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,889 INFO L138 Inliner]: procedures = 178, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-06 23:03:41,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:41,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:03:41,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:03:41,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:03:41,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:03:41,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:03:41,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:03:41,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:03:41,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (1/1) ... [2023-11-06 23:03:41,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:41,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:41,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:03:42,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:03:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:03:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:03:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:03:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:03:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:03:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:03:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:03:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:03:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:03:42,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:03:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:03:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:03:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:03:42,066 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 23:03:42,322 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:03:42,326 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:03:42,735 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:03:42,912 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:03:42,912 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:03:42,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:42 BoogieIcfgContainer [2023-11-06 23:03:42,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:03:42,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:03:42,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:03:42,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:03:42,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:03:41" (1/3) ... [2023-11-06 23:03:42,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d16489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:42, skipping insertion in model container [2023-11-06 23:03:42,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:41" (2/3) ... [2023-11-06 23:03:42,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d16489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:42, skipping insertion in model container [2023-11-06 23:03:42,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:42" (3/3) ... [2023-11-06 23:03:42,926 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-11-06 23:03:42,949 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:03:42,950 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-06 23:03:42,950 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:03:43,045 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:03:43,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 103 transitions, 214 flow [2023-11-06 23:03:43,218 INFO L124 PetriNetUnfolderBase]: 3/101 cut-off events. [2023-11-06 23:03:43,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:43,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-11-06 23:03:43,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 103 transitions, 214 flow [2023-11-06 23:03:43,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 101 transitions, 208 flow [2023-11-06 23:03:43,244 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:03:43,261 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 101 transitions, 208 flow [2023-11-06 23:03:43,266 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 101 transitions, 208 flow [2023-11-06 23:03:43,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 101 transitions, 208 flow [2023-11-06 23:03:43,325 INFO L124 PetriNetUnfolderBase]: 3/101 cut-off events. [2023-11-06 23:03:43,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:43,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-11-06 23:03:43,330 INFO L119 LiptonReduction]: Number of co-enabled transitions 1426 [2023-11-06 23:03:53,908 INFO L134 LiptonReduction]: Checked pairs total: 3538 [2023-11-06 23:03:53,909 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-11-06 23:03:53,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:03:53,931 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;@18aea632, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:03:53,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-06 23:03:53,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:03:53,934 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:03:53,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:53,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:53,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:03:53,935 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:53,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:53,940 INFO L85 PathProgramCache]: Analyzing trace with hash 488, now seen corresponding path program 1 times [2023-11-06 23:03:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:53,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410163076] [2023-11-06 23:03:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:53,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:03:53,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:53,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:53,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 23:03:54,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:54,051 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 23:03:54,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:54,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:54,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410163076] [2023-11-06 23:03:54,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410163076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:03:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762032515] [2023-11-06 23:03:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:54,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:03:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:54,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:03:54,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:03:54,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 215 [2023-11-06 23:03:54,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 91.5) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 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 23:03:54,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:54,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 215 [2023-11-06 23:03:54,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:54,300 INFO L124 PetriNetUnfolderBase]: 175/311 cut-off events. [2023-11-06 23:03:54,301 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 23:03:54,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 311 events. 175/311 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1250 event pairs, 175 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 623. Up to 307 conditions per place. [2023-11-06 23:03:54,310 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-11-06 23:03:54,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 74 flow [2023-11-06 23:03:54,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:03:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:03:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-11-06 23:03:54,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697674418604651 [2023-11-06 23:03:54,350 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-11-06 23:03:54,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-11-06 23:03:54,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:54,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-11-06 23:03:54,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 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 23:03:54,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 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 23:03:54,370 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 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 23:03:54,372 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 2 states and 202 transitions. [2023-11-06 23:03:54,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 74 flow [2023-11-06 23:03:54,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:54,377 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-11-06 23:03:54,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-11-06 23:03:54,385 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-11-06 23:03:54,386 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-11-06 23:03:54,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 91.5) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 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 23:03:54,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:54,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 23:03:54,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:54,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:54,598 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:54,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:54,608 INFO L85 PathProgramCache]: Analyzing trace with hash 481127, now seen corresponding path program 1 times [2023-11-06 23:03:54,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:54,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423692830] [2023-11-06 23:03:54,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:54,612 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 23:03:54,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:54,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:54,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:03:54,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:54,745 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 23:03:54,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:54,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:54,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423692830] [2023-11-06 23:03:54,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423692830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:54,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:54,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:03:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546472231] [2023-11-06 23:03:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:54,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:54,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:54,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:54,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:54,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 215 [2023-11-06 23:03:54,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 23:03:54,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:54,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 215 [2023-11-06 23:03:54,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:54,941 INFO L124 PetriNetUnfolderBase]: 135/255 cut-off events. [2023-11-06 23:03:54,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:54,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 255 events. 135/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1020 event pairs, 39 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 505. Up to 199 conditions per place. [2023-11-06 23:03:54,952 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 21 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2023-11-06 23:03:54,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 27 transitions, 110 flow [2023-11-06 23:03:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-06 23:03:54,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45891472868217054 [2023-11-06 23:03:54,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-06 23:03:54,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-06 23:03:54,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:54,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-06 23:03:54,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 23:03:54,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 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 23:03:54,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 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 23:03:54,973 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 296 transitions. [2023-11-06 23:03:54,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 27 transitions, 110 flow [2023-11-06 23:03:54,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:03:54,976 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-11-06 23:03:54,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-11-06 23:03:54,978 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-11-06 23:03:54,978 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-11-06 23:03:54,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 23:03:54,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:54,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:54,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:55,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:55,190 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:55,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2014508234, now seen corresponding path program 1 times [2023-11-06 23:03:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174135818] [2023-11-06 23:03:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:55,192 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 23:03:55,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:55,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:55,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:55,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 23:03:55,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:55,360 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 23:03:55,360 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:55,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174135818] [2023-11-06 23:03:55,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174135818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:55,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631776220] [2023-11-06 23:03:55,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:55,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:55,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:55,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:55,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:55,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 215 [2023-11-06 23:03:55,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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 23:03:55,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:55,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 215 [2023-11-06 23:03:55,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:55,603 INFO L124 PetriNetUnfolderBase]: 56/129 cut-off events. [2023-11-06 23:03:55,603 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-06 23:03:55,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 129 events. 56/129 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 450 event pairs, 12 based on Foata normal form. 16/137 useless extension candidates. Maximal degree in co-relation 279. Up to 69 conditions per place. [2023-11-06 23:03:55,604 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 19 selfloop transitions, 3 changer transitions 13/37 dead transitions. [2023-11-06 23:03:55,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 37 transitions, 160 flow [2023-11-06 23:03:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:03:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:03:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2023-11-06 23:03:55,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4344186046511628 [2023-11-06 23:03:55,609 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 467 transitions. [2023-11-06 23:03:55,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 467 transitions. [2023-11-06 23:03:55,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:55,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 467 transitions. [2023-11-06 23:03:55,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 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 23:03:55,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 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 23:03:55,618 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 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 23:03:55,618 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 467 transitions. [2023-11-06 23:03:55,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 37 transitions, 160 flow [2023-11-06 23:03:55,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:55,622 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 63 flow [2023-11-06 23:03:55,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-11-06 23:03:55,624 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-11-06 23:03:55,625 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 63 flow [2023-11-06 23:03:55,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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 23:03:55,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:55,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:55,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:55,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:55,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:55,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:55,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1189482608, now seen corresponding path program 1 times [2023-11-06 23:03:55,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:55,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038260880] [2023-11-06 23:03:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:55,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:03:55,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:55,841 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:55,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:55,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:03:55,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:56,019 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 23:03:56,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:56,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038260880] [2023-11-06 23:03:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038260880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294896891] [2023-11-06 23:03:56,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:56,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:56,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:56,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:56,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:56,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 215 [2023-11-06 23:03:56,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 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 23:03:56,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:56,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 215 [2023-11-06 23:03:56,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:56,228 INFO L124 PetriNetUnfolderBase]: 20/60 cut-off events. [2023-11-06 23:03:56,228 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 23:03:56,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 60 events. 20/60 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 8 based on Foata normal form. 7/65 useless extension candidates. Maximal degree in co-relation 160. Up to 24 conditions per place. [2023-11-06 23:03:56,229 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 17 selfloop transitions, 5 changer transitions 7/31 dead transitions. [2023-11-06 23:03:56,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 159 flow [2023-11-06 23:03:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:03:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:03:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2023-11-06 23:03:56,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42403100775193797 [2023-11-06 23:03:56,233 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 547 transitions. [2023-11-06 23:03:56,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 547 transitions. [2023-11-06 23:03:56,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:56,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 547 transitions. [2023-11-06 23:03:56,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 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 23:03:56,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 23:03:56,241 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 23:03:56,241 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 63 flow. Second operand 6 states and 547 transitions. [2023-11-06 23:03:56,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 159 flow [2023-11-06 23:03:56,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 146 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:56,244 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 74 flow [2023-11-06 23:03:56,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-11-06 23:03:56,245 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2023-11-06 23:03:56,245 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 74 flow [2023-11-06 23:03:56,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 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 23:03:56,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:56,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:56,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:56,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:56,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:56,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:56,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1330450994, now seen corresponding path program 1 times [2023-11-06 23:03:56,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:56,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773022720] [2023-11-06 23:03:56,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:56,460 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 23:03:56,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:56,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:56,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 23:03:56,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:56,855 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 23:03:56,855 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:56,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:56,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773022720] [2023-11-06 23:03:56,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773022720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:56,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:03:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649792726] [2023-11-06 23:03:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:56,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:56,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:56,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:57,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 215 [2023-11-06 23:03:57,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:57,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:57,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 215 [2023-11-06 23:03:57,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:57,114 INFO L124 PetriNetUnfolderBase]: 15/47 cut-off events. [2023-11-06 23:03:57,114 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-06 23:03:57,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 47 events. 15/47 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 93 event pairs, 7 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 129. Up to 38 conditions per place. [2023-11-06 23:03:57,115 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 16 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-11-06 23:03:57,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 20 transitions, 119 flow [2023-11-06 23:03:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:03:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-11-06 23:03:57,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3825581395348837 [2023-11-06 23:03:57,118 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-11-06 23:03:57,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-11-06 23:03:57,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:57,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-11-06 23:03:57,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 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 23:03:57,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 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 23:03:57,124 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 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 23:03:57,124 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 74 flow. Second operand 4 states and 329 transitions. [2023-11-06 23:03:57,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 20 transitions, 119 flow [2023-11-06 23:03:57,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 102 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-06 23:03:57,126 INFO L231 Difference]: Finished difference. Result has 28 places, 17 transitions, 60 flow [2023-11-06 23:03:57,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=28, PETRI_TRANSITIONS=17} [2023-11-06 23:03:57,127 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-11-06 23:03:57,127 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 60 flow [2023-11-06 23:03:57,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:57,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:57,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:57,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:57,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:57,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:57,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1702144831, now seen corresponding path program 1 times [2023-11-06 23:03:57,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:57,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726337820] [2023-11-06 23:03:57,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:57,346 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 23:03:57,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:57,348 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:57,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 (7)] Waiting until timeout for monitored process [2023-11-06 23:03:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:57,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 23:03:57,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:57,679 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 23:03:57,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:57,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:57,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726337820] [2023-11-06 23:03:57,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726337820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:57,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:57,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:57,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319941986] [2023-11-06 23:03:57,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:57,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:57,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 215 [2023-11-06 23:03:57,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 60 flow. Second operand has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 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 23:03:57,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:57,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 215 [2023-11-06 23:03:57,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:57,790 INFO L124 PetriNetUnfolderBase]: 19/61 cut-off events. [2023-11-06 23:03:57,790 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-06 23:03:57,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 61 events. 19/61 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 144 event pairs, 9 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 168. Up to 39 conditions per place. [2023-11-06 23:03:57,791 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 16 selfloop transitions, 3 changer transitions 6/26 dead transitions. [2023-11-06 23:03:57,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 144 flow [2023-11-06 23:03:57,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:03:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2023-11-06 23:03:57,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43488372093023253 [2023-11-06 23:03:57,794 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 374 transitions. [2023-11-06 23:03:57,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 374 transitions. [2023-11-06 23:03:57,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:57,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 374 transitions. [2023-11-06 23:03:57,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 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 23:03:57,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 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 23:03:57,798 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 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 23:03:57,798 INFO L175 Difference]: Start difference. First operand has 28 places, 17 transitions, 60 flow. Second operand 4 states and 374 transitions. [2023-11-06 23:03:57,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 144 flow [2023-11-06 23:03:57,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:57,800 INFO L231 Difference]: Finished difference. Result has 30 places, 17 transitions, 67 flow [2023-11-06 23:03:57,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2023-11-06 23:03:57,801 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2023-11-06 23:03:57,801 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 67 flow [2023-11-06 23:03:57,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 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 23:03:57,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:57,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:57,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 (7)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:58,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:58,022 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:58,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1100992045, now seen corresponding path program 2 times [2023-11-06 23:03:58,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:58,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118992623] [2023-11-06 23:03:58,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:03:58,024 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 23:03:58,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:58,025 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:58,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 (8)] Waiting until timeout for monitored process [2023-11-06 23:03:58,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:03:58,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:58,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:03:58,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:58,160 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 23:03:58,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:58,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:58,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118992623] [2023-11-06 23:03:58,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118992623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:58,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:58,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:03:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197521430] [2023-11-06 23:03:58,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:58,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:58,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:58,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 215 [2023-11-06 23:03:58,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 23:03:58,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:58,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 215 [2023-11-06 23:03:58,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:58,255 INFO L124 PetriNetUnfolderBase]: 17/59 cut-off events. [2023-11-06 23:03:58,255 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2023-11-06 23:03:58,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 59 events. 17/59 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 8 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 172. Up to 35 conditions per place. [2023-11-06 23:03:58,256 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 16 selfloop transitions, 2 changer transitions 9/28 dead transitions. [2023-11-06 23:03:58,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 165 flow [2023-11-06 23:03:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-11-06 23:03:58,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44651162790697674 [2023-11-06 23:03:58,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-11-06 23:03:58,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-11-06 23:03:58,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:58,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-11-06 23:03:58,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 23:03:58,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 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 23:03:58,264 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 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 23:03:58,264 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 67 flow. Second operand 3 states and 288 transitions. [2023-11-06 23:03:58,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 165 flow [2023-11-06 23:03:58,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 155 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-06 23:03:58,266 INFO L231 Difference]: Finished difference. Result has 30 places, 17 transitions, 67 flow [2023-11-06 23:03:58,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2023-11-06 23:03:58,267 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2023-11-06 23:03:58,267 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 67 flow [2023-11-06 23:03:58,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 23:03:58,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:58,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:58,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 (8)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:58,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:58,482 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:03:58,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash 851736253, now seen corresponding path program 3 times [2023-11-06 23:03:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:58,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663047144] [2023-11-06 23:03:58,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:03:58,484 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 23:03:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:58,485 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:58,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 (9)] Waiting until timeout for monitored process [2023-11-06 23:03:58,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 23:03:58,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 23:03:58,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:03:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:03:58,715 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 23:03:58,715 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:03:58,716 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-06 23:03:58,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-06 23:03:58,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-06 23:03:58,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-06 23:03:58,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-06 23:03:58,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-06 23:03:58,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-06 23:03:58,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-06 23:03:58,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-06 23:03:58,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-06 23:03:58,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 (9)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:58,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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 23:03:58,946 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-06 23:03:58,952 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:03:58,952 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:03:59,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:03:59 BasicIcfg [2023-11-06 23:03:59,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:03:59,013 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:03:59,013 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:03:59,014 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:03:59,014 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:42" (3/4) ... [2023-11-06 23:03:59,016 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:03:59,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:03:59,018 INFO L158 Benchmark]: Toolchain (without parser) took 17896.70ms. Allocated memory was 62.9MB in the beginning and 130.0MB in the end (delta: 67.1MB). Free memory was 37.8MB in the beginning and 99.1MB in the end (delta: -61.2MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2023-11-06 23:03:59,018 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 62.9MB. Free memory is still 39.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:03:59,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.16ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 37.7MB in the beginning and 51.1MB in the end (delta: -13.4MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2023-11-06 23:03:59,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.83ms. Allocated memory is still 86.0MB. Free memory was 51.1MB in the beginning and 48.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:03:59,020 INFO L158 Benchmark]: Boogie Preprocessor took 40.63ms. Allocated memory is still 86.0MB. Free memory was 48.4MB in the beginning and 46.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:03:59,020 INFO L158 Benchmark]: RCFGBuilder took 984.47ms. Allocated memory is still 86.0MB. Free memory was 46.3MB in the beginning and 51.6MB in the end (delta: -5.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2023-11-06 23:03:59,021 INFO L158 Benchmark]: TraceAbstraction took 16094.43ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 50.7MB in the beginning and 100.1MB in the end (delta: -49.4MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2023-11-06 23:03:59,021 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 130.0MB. Free memory was 100.1MB in the beginning and 99.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:03:59,024 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 62.9MB. Free memory is still 39.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 700.16ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 37.7MB in the beginning and 51.1MB in the end (delta: -13.4MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.83ms. Allocated memory is still 86.0MB. Free memory was 51.1MB in the beginning and 48.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.63ms. Allocated memory is still 86.0MB. Free memory was 48.4MB in the beginning and 46.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 984.47ms. Allocated memory is still 86.0MB. Free memory was 46.3MB in the beginning and 51.6MB in the end (delta: -5.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16094.43ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 50.7MB in the beginning and 100.1MB in the end (delta: -49.4MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 130.0MB. Free memory was 100.1MB in the beginning and 99.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.6s, 105 PlacesBefore, 29 PlacesAfterwards, 101 TransitionsBefore, 22 TransitionsAfterwards, 1426 CoEnabledTransitionPairs, 6 FixpointIterations, 46 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 112 TotalNumberOfCompositions, 3538 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1669, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 783, independent: 748, independent conditional: 0, independent unconditional: 748, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1669, independent: 797, independent conditional: 0, independent unconditional: 797, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 783, unknown conditional: 0, unknown unconditional: 783] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-1, t2473={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=0, t2473={3:0}, t2474={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={3:0}, t2474={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: 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: 788]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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 5 procedures, 120 locations, 10 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: 15.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 405 IncrementalHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 42 mSDtfsCounter, 405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=4, InterpolantAutomatonStates: 27, 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.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 519 SizeOfPredicates, 4 NumberOfNonLiveVariables, 647 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 23:03:59,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c71e655-3cfa-4728-b9ed-5e96fda30843/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