./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/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_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c62a6a6ca02e763ce9adebe2a1f0301f133cb0abc0bbd9fb473585b57a9c78f2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:33:35,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:33:35,620 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:33:35,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:33:35,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:33:35,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:33:35,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:33:35,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:33:35,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:33:35,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:33:35,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:33:35,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:33:35,696 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:33:35,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:33:35,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:33:35,699 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:33:35,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:33:35,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:33:35,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:33:35,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:33:35,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:33:35,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:33:35,703 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:33:35,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:33:35,704 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:33:35,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:33:35,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:33:35,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:33:35,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:35,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:33:35,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:33:35,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:33:35,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:33:35,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:33:35,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:33:35,709 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:33:35,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:33:35,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:33:35,725 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:33:35,726 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_85e12269-4014-4562-afd8-5accf06720ce/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_85e12269-4014-4562-afd8-5accf06720ce/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 ! call(reach_error())) ) 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 -> c62a6a6ca02e763ce9adebe2a1f0301f133cb0abc0bbd9fb473585b57a9c78f2 [2023-11-06 22:33:36,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:33:36,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:33:36,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:33:36,090 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:33:36,091 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:33:36,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2023-11-06 22:33:39,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:33:39,635 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:33:39,636 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2023-11-06 22:33:39,661 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/data/94967c90c/9cbc411afb6e4a0fa0d6886698f43051/FLAG10b2478e7 [2023-11-06 22:33:39,674 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/data/94967c90c/9cbc411afb6e4a0fa0d6886698f43051 [2023-11-06 22:33:39,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:33:39,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:33:39,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:39,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:33:39,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:33:39,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:39" (1/1) ... [2023-11-06 22:33:39,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aab015b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:39, skipping insertion in model container [2023-11-06 22:33:39,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:39" (1/1) ... [2023-11-06 22:33:39,774 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:33:39,948 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-06 22:33:40,474 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/sv-benchmarks/c/ldv-races/race-2_5-container_of.i[75002,75015] [2023-11-06 22:33:40,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:40,538 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:33:40,551 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-06 22:33:40,590 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/sv-benchmarks/c/ldv-races/race-2_5-container_of.i[75002,75015] [2023-11-06 22:33:40,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:40,746 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:33:40,747 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:33:40,747 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:33:40,755 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:33:40,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40 WrapperNode [2023-11-06 22:33:40,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:40,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:40,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:33:40,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:33:40,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,825 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2023-11-06 22:33:40,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:40,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:33:40,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:33:40,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:33:40,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:33:40,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:33:40,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:33:40,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:33:40,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (1/1) ... [2023-11-06 22:33:40,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:40,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:33:40,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:33:40,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:33:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:33:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:33:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:33:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:33:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 22:33:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:33:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:33:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:33:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:33:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-11-06 22:33:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-11-06 22:33:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:33:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:33:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:33:40,986 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:33:41,304 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:33:41,311 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:33:41,793 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:33:41,851 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:33:41,852 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:33:41,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:41 BoogieIcfgContainer [2023-11-06 22:33:41,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:33:41,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:33:41,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:33:41,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:33:41,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:33:39" (1/3) ... [2023-11-06 22:33:41,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1954ded6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:41, skipping insertion in model container [2023-11-06 22:33:41,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:40" (2/3) ... [2023-11-06 22:33:41,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1954ded6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:41, skipping insertion in model container [2023-11-06 22:33:41,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:41" (3/3) ... [2023-11-06 22:33:41,864 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2023-11-06 22:33:41,873 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:33:41,884 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:33:41,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-06 22:33:41,890 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:33:41,985 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-06 22:33:42,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 177 transitions, 368 flow [2023-11-06 22:33:42,152 INFO L124 PetriNetUnfolderBase]: 8/223 cut-off events. [2023-11-06 22:33:42,154 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:33:42,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 223 events. 8/223 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 414 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 114. Up to 4 conditions per place. [2023-11-06 22:33:42,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 177 transitions, 368 flow [2023-11-06 22:33:42,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 161 transitions, 334 flow [2023-11-06 22:33:42,182 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:33:42,210 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 161 transitions, 334 flow [2023-11-06 22:33:42,212 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 161 transitions, 334 flow [2023-11-06 22:33:42,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 161 transitions, 334 flow [2023-11-06 22:33:42,259 INFO L124 PetriNetUnfolderBase]: 5/196 cut-off events. [2023-11-06 22:33:42,259 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:33:42,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 196 events. 5/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2023-11-06 22:33:42,264 INFO L119 LiptonReduction]: Number of co-enabled transitions 3488 [2023-11-06 22:33:55,566 INFO L134 LiptonReduction]: Checked pairs total: 7993 [2023-11-06 22:33:55,567 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-11-06 22:33:55,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:33:55,591 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@10e71838, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:33:55,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-06 22:33:55,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:33:55,600 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-06 22:33:55,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:33:55,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:55,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:33:55,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-06 22:33:55,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 19853934, now seen corresponding path program 1 times [2023-11-06 22:33:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:55,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523527439] [2023-11-06 22:33:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:56,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:56,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523527439] [2023-11-06 22:33:56,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523527439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:56,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:56,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:33:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127989844] [2023-11-06 22:33:56,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:56,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:33:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:56,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:33:56,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:33:56,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 335 [2023-11-06 22:33:56,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:56,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:56,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 335 [2023-11-06 22:33:56,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:57,063 INFO L124 PetriNetUnfolderBase]: 552/1008 cut-off events. [2023-11-06 22:33:57,064 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:33:57,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 1008 events. 552/1008 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5008 event pairs, 307 based on Foata normal form. 0/924 useless extension candidates. Maximal degree in co-relation 1780. Up to 714 conditions per place. [2023-11-06 22:33:57,082 INFO L140 encePairwiseOnDemand]: 326/335 looper letters, 38 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-11-06 22:33:57,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 196 flow [2023-11-06 22:33:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:33:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:33:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-11-06 22:33:57,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46865671641791046 [2023-11-06 22:33:57,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-11-06 22:33:57,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-11-06 22:33:57,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:57,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-11-06 22:33:57,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:57,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:57,139 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:57,141 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 84 flow. Second operand 3 states and 471 transitions. [2023-11-06 22:33:57,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 196 flow [2023-11-06 22:33:57,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:33:57,149 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 124 flow [2023-11-06 22:33:57,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2023-11-06 22:33:57,156 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-06 22:33:57,157 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 124 flow [2023-11-06 22:33:57,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:57,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:57,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:33:57,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:33:57,158 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-06 22:33:57,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash 615473017, now seen corresponding path program 1 times [2023-11-06 22:33:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571988937] [2023-11-06 22:33:57,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:57,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:57,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:57,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571988937] [2023-11-06 22:33:57,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571988937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:57,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:57,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:33:57,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184028886] [2023-11-06 22:33:57,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:57,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:33:57,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:33:57,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:33:57,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 335 [2023-11-06 22:33:57,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:57,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:57,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 335 [2023-11-06 22:33:57,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:57,854 INFO L124 PetriNetUnfolderBase]: 780/1359 cut-off events. [2023-11-06 22:33:57,854 INFO L125 PetriNetUnfolderBase]: For 489/489 co-relation queries the response was YES. [2023-11-06 22:33:57,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3484 conditions, 1359 events. 780/1359 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6709 event pairs, 447 based on Foata normal form. 37/1382 useless extension candidates. Maximal degree in co-relation 843. Up to 1047 conditions per place. [2023-11-06 22:33:57,866 INFO L140 encePairwiseOnDemand]: 328/335 looper letters, 44 selfloop transitions, 9 changer transitions 2/56 dead transitions. [2023-11-06 22:33:57,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 296 flow [2023-11-06 22:33:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:33:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:33:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2023-11-06 22:33:57,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46766169154228854 [2023-11-06 22:33:57,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2023-11-06 22:33:57,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2023-11-06 22:33:57,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:57,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2023-11-06 22:33:57,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:57,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:57,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:57,878 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 124 flow. Second operand 3 states and 470 transitions. [2023-11-06 22:33:57,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 296 flow [2023-11-06 22:33:57,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:33:57,885 INFO L231 Difference]: Finished difference. Result has 41 places, 46 transitions, 181 flow [2023-11-06 22:33:57,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=41, PETRI_TRANSITIONS=46} [2023-11-06 22:33:57,887 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-06 22:33:57,887 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 46 transitions, 181 flow [2023-11-06 22:33:57,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:57,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:57,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:57,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:33:57,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-06 22:33:57,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:57,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1019222711, now seen corresponding path program 1 times [2023-11-06 22:33:57,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:57,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202399128] [2023-11-06 22:33:57,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:57,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202399128] [2023-11-06 22:33:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202399128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:58,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:58,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:33:58,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851353114] [2023-11-06 22:33:58,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:58,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:33:58,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:58,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:33:58,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:33:58,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 335 [2023-11-06 22:33:58,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 46 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:58,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:58,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 335 [2023-11-06 22:33:58,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:58,157 INFO L124 PetriNetUnfolderBase]: 163/331 cut-off events. [2023-11-06 22:33:58,157 INFO L125 PetriNetUnfolderBase]: For 150/166 co-relation queries the response was YES. [2023-11-06 22:33:58,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 331 events. 163/331 cut-off events. For 150/166 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1232 event pairs, 46 based on Foata normal form. 50/364 useless extension candidates. Maximal degree in co-relation 762. Up to 240 conditions per place. [2023-11-06 22:33:58,161 INFO L140 encePairwiseOnDemand]: 333/335 looper letters, 31 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2023-11-06 22:33:58,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 164 flow [2023-11-06 22:33:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:33:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:33:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2023-11-06 22:33:58,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48656716417910445 [2023-11-06 22:33:58,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 489 transitions. [2023-11-06 22:33:58,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 489 transitions. [2023-11-06 22:33:58,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:58,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 489 transitions. [2023-11-06 22:33:58,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:58,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:58,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:58,173 INFO L175 Difference]: Start difference. First operand has 41 places, 46 transitions, 181 flow. Second operand 3 states and 489 transitions. [2023-11-06 22:33:58,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 164 flow [2023-11-06 22:33:58,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 152 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-06 22:33:58,175 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 70 flow [2023-11-06 22:33:58,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-11-06 22:33:58,177 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2023-11-06 22:33:58,177 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 70 flow [2023-11-06 22:33:58,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:58,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:58,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:58,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:33:58,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-06 22:33:58,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1342900113, now seen corresponding path program 1 times [2023-11-06 22:33:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267323157] [2023-11-06 22:33:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:58,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:58,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267323157] [2023-11-06 22:33:58,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267323157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:58,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:33:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098937600] [2023-11-06 22:33:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:58,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:33:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:58,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:33:58,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:33:58,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 335 [2023-11-06 22:33:58,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:58,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:58,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 335 [2023-11-06 22:33:58,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:58,771 INFO L124 PetriNetUnfolderBase]: 198/391 cut-off events. [2023-11-06 22:33:58,771 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-11-06 22:33:58,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 391 events. 198/391 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1348 event pairs, 167 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 906. Up to 339 conditions per place. [2023-11-06 22:33:58,775 INFO L140 encePairwiseOnDemand]: 328/335 looper letters, 31 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2023-11-06 22:33:58,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 171 flow [2023-11-06 22:33:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:33:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:33:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-11-06 22:33:58,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4646766169154229 [2023-11-06 22:33:58,779 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-11-06 22:33:58,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-11-06 22:33:58,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:58,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-11-06 22:33:58,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 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 22:33:58,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:58,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:58,786 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 70 flow. Second operand 3 states and 467 transitions. [2023-11-06 22:33:58,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 171 flow [2023-11-06 22:33:58,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:33:58,789 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 119 flow [2023-11-06 22:33:58,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-11-06 22:33:58,790 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-06 22:33:58,791 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 119 flow [2023-11-06 22:33:58,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:58,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:58,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:58,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:33:58,792 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-06 22:33:58,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash 900458802, now seen corresponding path program 1 times [2023-11-06 22:33:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:58,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805113425] [2023-11-06 22:33:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:59,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805113425] [2023-11-06 22:33:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805113425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:59,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:59,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:33:59,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571124426] [2023-11-06 22:33:59,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:59,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:33:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:59,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:33:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:33:59,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 335 [2023-11-06 22:33:59,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:59,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:59,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 335 [2023-11-06 22:33:59,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:59,294 INFO L124 PetriNetUnfolderBase]: 214/430 cut-off events. [2023-11-06 22:33:59,294 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2023-11-06 22:33:59,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 430 events. 214/430 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1537 event pairs, 176 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 1111. Up to 366 conditions per place. [2023-11-06 22:33:59,298 INFO L140 encePairwiseOnDemand]: 328/335 looper letters, 35 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2023-11-06 22:33:59,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 258 flow [2023-11-06 22:33:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:33:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:33:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-11-06 22:33:59,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46567164179104475 [2023-11-06 22:33:59,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-11-06 22:33:59,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-11-06 22:33:59,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:59,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-11-06 22:33:59,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:59,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:59,309 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:59,309 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 119 flow. Second operand 3 states and 468 transitions. [2023-11-06 22:33:59,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 258 flow [2023-11-06 22:33:59,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 232 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 22:33:59,312 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 177 flow [2023-11-06 22:33:59,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2023-11-06 22:33:59,314 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-06 22:33:59,314 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 177 flow [2023-11-06 22:33:59,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:59,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:59,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:59,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:33:59,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-06 22:33:59,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash 439463462, now seen corresponding path program 1 times [2023-11-06 22:33:59,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:59,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068562044] [2023-11-06 22:33:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:00,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:00,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068562044] [2023-11-06 22:34:00,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068562044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:00,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:00,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:34:00,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621568157] [2023-11-06 22:34:00,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:00,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:34:00,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:00,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:34:00,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:34:00,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 335 [2023-11-06 22:34:00,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 152.66666666666666) internal successors, (916), 6 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:00,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:00,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 335 [2023-11-06 22:34:00,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:00,524 INFO L124 PetriNetUnfolderBase]: 186/399 cut-off events. [2023-11-06 22:34:00,524 INFO L125 PetriNetUnfolderBase]: For 183/185 co-relation queries the response was YES. [2023-11-06 22:34:00,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 399 events. 186/399 cut-off events. For 183/185 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1721 event pairs, 24 based on Foata normal form. 11/391 useless extension candidates. Maximal degree in co-relation 1025. Up to 272 conditions per place. [2023-11-06 22:34:00,529 INFO L140 encePairwiseOnDemand]: 327/335 looper letters, 47 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2023-11-06 22:34:00,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 364 flow [2023-11-06 22:34:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:34:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:34:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1102 transitions. [2023-11-06 22:34:00,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46993603411513857 [2023-11-06 22:34:00,535 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1102 transitions. [2023-11-06 22:34:00,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1102 transitions. [2023-11-06 22:34:00,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:00,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1102 transitions. [2023-11-06 22:34:00,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.42857142857142) internal successors, (1102), 7 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:00,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 335.0) internal successors, (2680), 8 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:00,548 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 335.0) internal successors, (2680), 8 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:00,548 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 177 flow. Second operand 7 states and 1102 transitions. [2023-11-06 22:34:00,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 364 flow [2023-11-06 22:34:00,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 344 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:34:00,552 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 230 flow [2023-11-06 22:34:00,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2023-11-06 22:34:00,553 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-11-06 22:34:00,554 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 230 flow [2023-11-06 22:34:00,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.66666666666666) internal successors, (916), 6 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:00,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:00,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:00,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:34:00,555 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-06 22:34:00,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -194852670, now seen corresponding path program 2 times [2023-11-06 22:34:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739092033] [2023-11-06 22:34:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:34:00,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:34:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:34:00,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:34:00,707 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:34:00,708 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-11-06 22:34:00,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-11-06 22:34:00,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-11-06 22:34:00,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-11-06 22:34:00,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-11-06 22:34:00,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-11-06 22:34:00,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-11-06 22:34:00,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-11-06 22:34:00,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:34:00,712 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-06 22:34:00,719 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:34:00,719 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:34:00,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:34:00 BasicIcfg [2023-11-06 22:34:00,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:34:00,769 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:34:00,769 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:34:00,770 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:34:00,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:41" (3/4) ... [2023-11-06 22:34:00,771 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:34:00,850 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:34:00,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:34:00,853 INFO L158 Benchmark]: Toolchain (without parser) took 21173.79ms. Allocated memory was 121.6MB in the beginning and 237.0MB in the end (delta: 115.3MB). Free memory was 55.6MB in the beginning and 72.5MB in the end (delta: -16.9MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2023-11-06 22:34:00,855 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 121.6MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:34:00,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1075.13ms. Allocated memory was 121.6MB in the beginning and 161.5MB in the end (delta: 39.8MB). Free memory was 55.6MB in the beginning and 89.8MB in the end (delta: -34.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2023-11-06 22:34:00,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.94ms. Allocated memory is still 161.5MB. Free memory was 89.8MB in the beginning and 86.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:34:00,857 INFO L158 Benchmark]: Boogie Preprocessor took 54.90ms. Allocated memory is still 161.5MB. Free memory was 86.1MB in the beginning and 83.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:34:00,857 INFO L158 Benchmark]: RCFGBuilder took 972.07ms. Allocated memory is still 161.5MB. Free memory was 83.5MB in the beginning and 116.1MB in the end (delta: -32.6MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2023-11-06 22:34:00,858 INFO L158 Benchmark]: TraceAbstraction took 18911.70ms. Allocated memory was 161.5MB in the beginning and 237.0MB in the end (delta: 75.5MB). Free memory was 116.1MB in the beginning and 78.8MB in the end (delta: 37.2MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2023-11-06 22:34:00,858 INFO L158 Benchmark]: Witness Printer took 82.52ms. Allocated memory is still 237.0MB. Free memory was 78.8MB in the beginning and 72.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:34:00,864 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.22ms. Allocated memory is still 121.6MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1075.13ms. Allocated memory was 121.6MB in the beginning and 161.5MB in the end (delta: 39.8MB). Free memory was 55.6MB in the beginning and 89.8MB in the end (delta: -34.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.94ms. Allocated memory is still 161.5MB. Free memory was 89.8MB in the beginning and 86.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.90ms. Allocated memory is still 161.5MB. Free memory was 86.1MB in the beginning and 83.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 972.07ms. Allocated memory is still 161.5MB. Free memory was 83.5MB in the beginning and 116.1MB in the end (delta: -32.6MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18911.70ms. Allocated memory was 161.5MB in the beginning and 237.0MB in the end (delta: 75.5MB). Free memory was 116.1MB in the beginning and 78.8MB in the end (delta: 37.2MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. * Witness Printer took 82.52ms. Allocated memory is still 237.0MB. Free memory was 78.8MB in the beginning and 72.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.4s, 163 PlacesBefore, 40 PlacesAfterwards, 161 TransitionsBefore, 36 TransitionsAfterwards, 3488 CoEnabledTransitionPairs, 8 FixpointIterations, 75 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 158 TotalNumberOfCompositions, 7993 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3466, independent: 3127, independent conditional: 0, independent unconditional: 3127, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1887, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3466, independent: 1290, independent conditional: 0, independent unconditional: 1290, dependent: 289, dependent conditional: 0, dependent unconditional: 289, unknown: 1887, unknown conditional: 0, unknown unconditional: 1887] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); [L1746] COND TRUE 0 ret==0 [L1747] 0 int probe_ret; [L1748] 0 struct my_data data; [L1749] CALL, EXPR 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; [L1708] 0 data->shared.a = 0 [L1709] 0 data->shared.b = 0 [L1710] 0 int res = __VERIFIER_nondet_int(); [L1711] COND FALSE 0 !(\read(res)) [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=-5, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1694] 1 data->shared.a = 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1697] EXPR 1 data->shared.b [L1697] 1 int lb = data->shared.b; [L1700] 1 data->shared.b = lb + 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1703] 1 return 0; [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\result={0:0}, arg={6:24}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=-4, res=0, t1={3:0}, t2={4:0}] [L1689] 2 struct device *dev = (struct device*)arg; [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1715] 0 return 0; [L1749] RET, EXPR 0 my_drv_probe(&data) [L1749] 0 probe_ret = my_drv_probe(&data) [L1750] COND TRUE 0 probe_ret==0 [L1751] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [\read(t1)=-5, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, pthread_mutex_lock (&data->lock)=0, status={5:0}, t1={3:0}, t2={4:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=-5, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, pthread_join(t1, &status)={0:0}, pthread_mutex_lock (&data->lock)=0, status={5:0}, t1={3:0}, t2={4:0}] [L1724] 0 data->shared.a = 3 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, pthread_mutex_lock (&data->lock)=0, status={5:0}, t1={3:0}, t2={4:0}] [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1727] 0 data->shared.b = 3 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1730] EXPR 0 data->shared.a [L1730] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1713]: 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: 1714]: 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 4 procedures, 190 locations, 8 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: 18.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 693 IncrementalHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 62 mSDtfsCounter, 693 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=6, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 proved your program to be incorrect! [2023-11-06 22:34:00,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85e12269-4014-4562-afd8-5accf06720ce/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE