./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-2_2-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_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/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_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_2-container_of.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/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_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/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 dbdd132d1a656eb04120c9309772a096548e218c86a32fc06dd93d5ae981c163 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:51:58,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:51:58,704 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:51:58,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:51:58,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:51:58,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:51:58,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:51:58,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:51:58,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:51:58,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:51:58,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:51:58,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:51:58,742 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:51:58,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:51:58,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:51:58,743 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:51:58,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:51:58,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:51:58,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:51:58,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:51:58,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:51:58,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:51:58,747 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:51:58,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:51:58,748 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:51:58,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:51:58,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:51:58,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:51:58,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:58,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:51:58,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:51:58,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:51:58,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:51:58,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:51:58,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:51:58,754 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:51:58,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:51:58,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:51:58,756 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:51:58,757 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_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/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_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/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 -> dbdd132d1a656eb04120c9309772a096548e218c86a32fc06dd93d5ae981c163 [2023-11-06 22:51:59,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:51:59,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:51:59,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:51:59,073 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:51:59,075 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:51:59,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2023-11-06 22:52:02,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:52:02,661 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:52:02,662 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2023-11-06 22:52:02,696 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/bin/uautomizer-verify-WvqO1wxjHP/data/ab62f2df0/a2363e53e65f48c084424a83b5c1f66f/FLAGc45b574b1 [2023-11-06 22:52:02,721 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/bin/uautomizer-verify-WvqO1wxjHP/data/ab62f2df0/a2363e53e65f48c084424a83b5c1f66f [2023-11-06 22:52:02,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:52:02,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:52:02,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:52:02,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:52:02,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:52:02,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:02" (1/1) ... [2023-11-06 22:52:02,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0c9839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:02, skipping insertion in model container [2023-11-06 22:52:02,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:02" (1/1) ... [2023-11-06 22:52:02,824 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:52:02,987 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-06 22:52:03,658 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_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[75002,75015] [2023-11-06 22:52:03,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:52:03,722 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:52:03,740 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-06 22:52:03,839 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_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[75002,75015] [2023-11-06 22:52:03,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:52:04,004 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:52:04,004 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:52:04,004 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:52:04,012 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:52:04,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04 WrapperNode [2023-11-06 22:52:04,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:52:04,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:52:04,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:52:04,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:52:04,023 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:52:04" (1/1) ... [2023-11-06 22:52:04,075 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:52:04" (1/1) ... [2023-11-06 22:52:04,116 INFO L138 Inliner]: procedures = 468, calls = 48, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2023-11-06 22:52:04,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:52:04,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:52:04,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:52:04,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:52:04,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04" (1/1) ... [2023-11-06 22:52:04,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04" (1/1) ... [2023-11-06 22:52:04,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04" (1/1) ... [2023-11-06 22:52:04,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04" (1/1) ... [2023-11-06 22:52:04,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04" (1/1) ... [2023-11-06 22:52:04,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04" (1/1) ... [2023-11-06 22:52:04,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04" (1/1) ... [2023-11-06 22:52:04,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04" (1/1) ... [2023-11-06 22:52:04,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:52:04,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:52:04,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:52:04,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:52:04,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04" (1/1) ... [2023-11-06 22:52:04,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:52:04,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:04,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/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:52:04,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/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:52:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:52:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:52:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:52:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:52:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:52:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:52:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:52:04,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:52:04,262 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-11-06 22:52:04,262 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-11-06 22:52:04,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:52:04,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:52:04,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:52:04,264 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:52:04,598 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:52:04,600 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:52:04,848 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:52:04,870 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:52:04,870 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:52:04,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:04 BoogieIcfgContainer [2023-11-06 22:52:04,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:52:04,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:52:04,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:52:04,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:52:04,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:52:02" (1/3) ... [2023-11-06 22:52:04,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2d3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:04, skipping insertion in model container [2023-11-06 22:52:04,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:04" (2/3) ... [2023-11-06 22:52:04,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2d3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:04, skipping insertion in model container [2023-11-06 22:52:04,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:04" (3/3) ... [2023-11-06 22:52:04,883 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2023-11-06 22:52:04,893 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:52:04,947 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:52:04,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-06 22:52:04,948 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:52:05,049 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-06 22:52:05,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 165 transitions, 344 flow [2023-11-06 22:52:05,235 INFO L124 PetriNetUnfolderBase]: 8/211 cut-off events. [2023-11-06 22:52:05,235 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:52:05,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 211 events. 8/211 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 111. Up to 4 conditions per place. [2023-11-06 22:52:05,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 165 transitions, 344 flow [2023-11-06 22:52:05,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 149 transitions, 310 flow [2023-11-06 22:52:05,262 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:52:05,272 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 149 transitions, 310 flow [2023-11-06 22:52:05,276 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 149 transitions, 310 flow [2023-11-06 22:52:05,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 149 transitions, 310 flow [2023-11-06 22:52:05,319 INFO L124 PetriNetUnfolderBase]: 5/184 cut-off events. [2023-11-06 22:52:05,319 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:52:05,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 184 events. 5/184 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 309 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 97. Up to 4 conditions per place. [2023-11-06 22:52:05,323 INFO L119 LiptonReduction]: Number of co-enabled transitions 2600 [2023-11-06 22:52:17,932 INFO L134 LiptonReduction]: Checked pairs total: 3632 [2023-11-06 22:52:17,933 INFO L136 LiptonReduction]: Total number of compositions: 157 [2023-11-06 22:52:17,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:52:17,956 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;@61364c40, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:52:17,957 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:52:17,962 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:52:17,962 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-11-06 22:52:17,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:52:17,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:17,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:52:17,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:17,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:17,970 INFO L85 PathProgramCache]: Analyzing trace with hash 17201993, now seen corresponding path program 1 times [2023-11-06 22:52:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145628768] [2023-11-06 22:52:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:17,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:18,756 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:52:18,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:18,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145628768] [2023-11-06 22:52:18,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145628768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:18,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:18,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:18,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772858754] [2023-11-06 22:52:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:18,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:18,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:18,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:18,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 322 [2023-11-06 22:52:18,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:52:18,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:52:18,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 322 [2023-11-06 22:52:18,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:52:19,110 INFO L124 PetriNetUnfolderBase]: 218/420 cut-off events. [2023-11-06 22:52:19,111 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-06 22:52:19,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 420 events. 218/420 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1893 event pairs, 112 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 766. Up to 313 conditions per place. [2023-11-06 22:52:19,117 INFO L140 encePairwiseOnDemand]: 314/322 looper letters, 25 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2023-11-06 22:52:19,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 142 flow [2023-11-06 22:52:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:52:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-06 22:52:19,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453416149068323 [2023-11-06 22:52:19,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-06 22:52:19,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-06 22:52:19,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:52:19,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-06 22:52:19,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:19,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:52:19,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:52:19,157 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 62 flow. Second operand 3 states and 438 transitions. [2023-11-06 22:52:19,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 142 flow [2023-11-06 22:52:19,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:52:19,164 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 104 flow [2023-11-06 22:52:19,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2023-11-06 22:52:19,170 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-11-06 22:52:19,170 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 104 flow [2023-11-06 22:52:19,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:52:19,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:19,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:52:19,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:52:19,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:19,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:19,173 INFO L85 PathProgramCache]: Analyzing trace with hash 533263046, now seen corresponding path program 1 times [2023-11-06 22:52:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595779432] [2023-11-06 22:52:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:19,422 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:52:19,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:19,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595779432] [2023-11-06 22:52:19,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595779432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:19,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:19,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:19,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685116421] [2023-11-06 22:52:19,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:19,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:19,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:19,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:19,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:19,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 322 [2023-11-06 22:52:19,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:19,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:52:19,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 322 [2023-11-06 22:52:19,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:52:19,723 INFO L124 PetriNetUnfolderBase]: 313/573 cut-off events. [2023-11-06 22:52:19,724 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2023-11-06 22:52:19,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 573 events. 313/573 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2606 event pairs, 149 based on Foata normal form. 17/588 useless extension candidates. Maximal degree in co-relation 355. Up to 462 conditions per place. [2023-11-06 22:52:19,731 INFO L140 encePairwiseOnDemand]: 315/322 looper letters, 31 selfloop transitions, 9 changer transitions 2/42 dead transitions. [2023-11-06 22:52:19,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 42 transitions, 242 flow [2023-11-06 22:52:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:52:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-11-06 22:52:19,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45445134575569357 [2023-11-06 22:52:19,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-11-06 22:52:19,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-11-06 22:52:19,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:52:19,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-11-06 22:52:19,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:19,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:52:19,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:52:19,753 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 104 flow. Second operand 3 states and 439 transitions. [2023-11-06 22:52:19,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 42 transitions, 242 flow [2023-11-06 22:52:19,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 42 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:52:19,763 INFO L231 Difference]: Finished difference. Result has 31 places, 36 transitions, 161 flow [2023-11-06 22:52:19,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=31, PETRI_TRANSITIONS=36} [2023-11-06 22:52:19,768 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2023-11-06 22:52:19,768 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 36 transitions, 161 flow [2023-11-06 22:52:19,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:19,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:19,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:19,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:52:19,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:19,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:19,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1141243361, now seen corresponding path program 1 times [2023-11-06 22:52:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248675484] [2023-11-06 22:52:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:19,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:19,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248675484] [2023-11-06 22:52:19,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248675484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:19,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:19,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:52:19,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180598336] [2023-11-06 22:52:19,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:19,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:52:19,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:19,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:52:19,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:19,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 322 [2023-11-06 22:52:19,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 36 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:19,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:52:19,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 322 [2023-11-06 22:52:19,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:52:19,966 INFO L124 PetriNetUnfolderBase]: 72/144 cut-off events. [2023-11-06 22:52:19,967 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2023-11-06 22:52:19,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 144 events. 72/144 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 421 event pairs, 15 based on Foata normal form. 16/159 useless extension candidates. Maximal degree in co-relation 409. Up to 104 conditions per place. [2023-11-06 22:52:19,969 INFO L140 encePairwiseOnDemand]: 320/322 looper letters, 23 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2023-11-06 22:52:19,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 132 flow [2023-11-06 22:52:19,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:52:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-11-06 22:52:19,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730848861283644 [2023-11-06 22:52:19,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-11-06 22:52:19,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-11-06 22:52:19,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:52:19,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-11-06 22:52:19,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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:52:19,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:52:19,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:52:19,979 INFO L175 Difference]: Start difference. First operand has 31 places, 36 transitions, 161 flow. Second operand 3 states and 457 transitions. [2023-11-06 22:52:19,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 132 flow [2023-11-06 22:52:19,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 116 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-06 22:52:19,997 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 50 flow [2023-11-06 22:52:19,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2023-11-06 22:52:19,998 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-11-06 22:52:19,998 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 50 flow [2023-11-06 22:52:19,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:19,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:20,000 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:52:20,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:52:20,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:20,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash 28303264, now seen corresponding path program 1 times [2023-11-06 22:52:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:20,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895924891] [2023-11-06 22:52:20,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:21,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895924891] [2023-11-06 22:52:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895924891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:21,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:52:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229066842] [2023-11-06 22:52:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:21,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:52:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:52:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:52:22,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 322 [2023-11-06 22:52:22,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 50 flow. Second operand has 10 states, 10 states have (on average 125.7) internal successors, (1257), 10 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states 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:52:22,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:52:22,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 322 [2023-11-06 22:52:22,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:52:23,012 INFO L124 PetriNetUnfolderBase]: 134/282 cut-off events. [2023-11-06 22:52:23,013 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-06 22:52:23,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 282 events. 134/282 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1131 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 702. Up to 109 conditions per place. [2023-11-06 22:52:23,015 INFO L140 encePairwiseOnDemand]: 312/322 looper letters, 54 selfloop transitions, 17 changer transitions 0/71 dead transitions. [2023-11-06 22:52:23,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 71 transitions, 345 flow [2023-11-06 22:52:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:52:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:52:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1312 transitions. [2023-11-06 22:52:23,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074534161490683 [2023-11-06 22:52:23,022 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1312 transitions. [2023-11-06 22:52:23,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1312 transitions. [2023-11-06 22:52:23,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:52:23,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1312 transitions. [2023-11-06 22:52:23,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 131.2) internal successors, (1312), 10 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states 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:52:23,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 322.0) internal successors, (3542), 11 states have internal predecessors, (3542), 0 states have call successors, (0), 0 states 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:52:23,039 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 322.0) internal successors, (3542), 11 states have internal predecessors, (3542), 0 states have call successors, (0), 0 states 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:52:23,039 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 50 flow. Second operand 10 states and 1312 transitions. [2023-11-06 22:52:23,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 71 transitions, 345 flow [2023-11-06 22:52:23,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 71 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:52:23,044 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 158 flow [2023-11-06 22:52:23,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=158, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-11-06 22:52:23,046 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-11-06 22:52:23,047 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 158 flow [2023-11-06 22:52:23,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.7) internal successors, (1257), 10 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states 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:52:23,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:23,048 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:52:23,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:52:23,049 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:23,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:23,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1438920808, now seen corresponding path program 2 times [2023-11-06 22:52:23,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:23,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318216718] [2023-11-06 22:52:23,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:23,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:24,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:24,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318216718] [2023-11-06 22:52:24,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318216718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:24,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:24,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:52:24,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651180867] [2023-11-06 22:52:24,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:24,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:52:24,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:24,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:52:24,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:52:24,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 322 [2023-11-06 22:52:24,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 130.42857142857142) internal successors, (913), 7 states have internal predecessors, (913), 0 states have call successors, (0), 0 states 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:52:24,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:52:24,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 322 [2023-11-06 22:52:24,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:52:24,844 INFO L124 PetriNetUnfolderBase]: 151/334 cut-off events. [2023-11-06 22:52:24,844 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2023-11-06 22:52:24,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 334 events. 151/334 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1471 event pairs, 22 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 1028. Up to 124 conditions per place. [2023-11-06 22:52:24,848 INFO L140 encePairwiseOnDemand]: 314/322 looper letters, 38 selfloop transitions, 20 changer transitions 0/58 dead transitions. [2023-11-06 22:52:24,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 382 flow [2023-11-06 22:52:24,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:52:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:52:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions. [2023-11-06 22:52:24,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.417036379769299 [2023-11-06 22:52:24,855 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions. [2023-11-06 22:52:24,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions. [2023-11-06 22:52:24,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:52:24,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions. [2023-11-06 22:52:24,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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:52:24,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 322.0) internal successors, (2576), 8 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states 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:52:24,866 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 322.0) internal successors, (2576), 8 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states 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:52:24,866 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 158 flow. Second operand 7 states and 940 transitions. [2023-11-06 22:52:24,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 382 flow [2023-11-06 22:52:24,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:52:24,870 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 242 flow [2023-11-06 22:52:24,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=242, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-11-06 22:52:24,874 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2023-11-06 22:52:24,874 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 242 flow [2023-11-06 22:52:24,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 130.42857142857142) internal successors, (913), 7 states have internal predecessors, (913), 0 states have call successors, (0), 0 states 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:52:24,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:24,875 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:52:24,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:52:24,876 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:24,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash 398162248, now seen corresponding path program 1 times [2023-11-06 22:52:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:24,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472005440] [2023-11-06 22:52:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:26,896 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:52:26,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:26,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472005440] [2023-11-06 22:52:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472005440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:26,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:26,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:52:26,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31230654] [2023-11-06 22:52:26,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:26,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:52:26,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:26,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:52:26,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:52:28,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 322 [2023-11-06 22:52:28,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 242 flow. Second operand has 13 states, 13 states have (on average 121.3076923076923) internal successors, (1577), 13 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states 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:52:28,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:52:28,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 322 [2023-11-06 22:52:28,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:52:29,654 INFO L124 PetriNetUnfolderBase]: 185/416 cut-off events. [2023-11-06 22:52:29,654 INFO L125 PetriNetUnfolderBase]: For 727/727 co-relation queries the response was YES. [2023-11-06 22:52:29,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 416 events. 185/416 cut-off events. For 727/727 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1956 event pairs, 61 based on Foata normal form. 2/416 useless extension candidates. Maximal degree in co-relation 1460. Up to 332 conditions per place. [2023-11-06 22:52:29,658 INFO L140 encePairwiseOnDemand]: 309/322 looper letters, 50 selfloop transitions, 31 changer transitions 14/95 dead transitions. [2023-11-06 22:52:29,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 95 transitions, 773 flow [2023-11-06 22:52:29,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:52:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-06 22:52:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1749 transitions. [2023-11-06 22:52:29,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38797692990239574 [2023-11-06 22:52:29,667 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1749 transitions. [2023-11-06 22:52:29,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1749 transitions. [2023-11-06 22:52:29,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:52:29,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1749 transitions. [2023-11-06 22:52:29,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 124.92857142857143) internal successors, (1749), 14 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states 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:52:29,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 322.0) internal successors, (4830), 15 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states 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:52:29,685 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 322.0) internal successors, (4830), 15 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states 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:52:29,686 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 242 flow. Second operand 14 states and 1749 transitions. [2023-11-06 22:52:29,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 95 transitions, 773 flow [2023-11-06 22:52:29,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 715 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-06 22:52:29,692 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 536 flow [2023-11-06 22:52:29,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=536, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2023-11-06 22:52:29,694 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2023-11-06 22:52:29,694 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 536 flow [2023-11-06 22:52:29,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 121.3076923076923) internal successors, (1577), 13 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states 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:52:29,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:29,695 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:52:29,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:52:29,696 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:29,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1662892452, now seen corresponding path program 2 times [2023-11-06 22:52:29,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:29,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460358905] [2023-11-06 22:52:29,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:29,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:52:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460358905] [2023-11-06 22:52:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460358905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:31,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:31,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:52:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613112688] [2023-11-06 22:52:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:31,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:52:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:31,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:52:31,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:52:33,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 322 [2023-11-06 22:52:33,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 536 flow. Second operand has 13 states, 13 states have (on average 122.3076923076923) internal successors, (1590), 13 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:52:33,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:52:33,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 322 [2023-11-06 22:52:33,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:52:34,588 INFO L124 PetriNetUnfolderBase]: 191/445 cut-off events. [2023-11-06 22:52:34,588 INFO L125 PetriNetUnfolderBase]: For 987/987 co-relation queries the response was YES. [2023-11-06 22:52:34,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 445 events. 191/445 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2209 event pairs, 24 based on Foata normal form. 1/442 useless extension candidates. Maximal degree in co-relation 1834. Up to 196 conditions per place. [2023-11-06 22:52:34,593 INFO L140 encePairwiseOnDemand]: 308/322 looper letters, 90 selfloop transitions, 52 changer transitions 13/155 dead transitions. [2023-11-06 22:52:34,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 155 transitions, 1409 flow [2023-11-06 22:52:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:52:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-06 22:52:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2034 transitions. [2023-11-06 22:52:34,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39479813664596275 [2023-11-06 22:52:34,608 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2034 transitions. [2023-11-06 22:52:34,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2034 transitions. [2023-11-06 22:52:34,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:52:34,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2034 transitions. [2023-11-06 22:52:34,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 127.125) internal successors, (2034), 16 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states 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:52:34,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 322.0) internal successors, (5474), 17 states have internal predecessors, (5474), 0 states have call successors, (0), 0 states 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:52:34,632 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 322.0) internal successors, (5474), 17 states have internal predecessors, (5474), 0 states have call successors, (0), 0 states 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:52:34,632 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 536 flow. Second operand 16 states and 2034 transitions. [2023-11-06 22:52:34,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 155 transitions, 1409 flow [2023-11-06 22:52:34,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 155 transitions, 1317 flow, removed 44 selfloop flow, removed 4 redundant places. [2023-11-06 22:52:34,645 INFO L231 Difference]: Finished difference. Result has 79 places, 105 transitions, 961 flow [2023-11-06 22:52:34,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=961, PETRI_PLACES=79, PETRI_TRANSITIONS=105} [2023-11-06 22:52:34,647 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2023-11-06 22:52:34,647 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 105 transitions, 961 flow [2023-11-06 22:52:34,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 122.3076923076923) internal successors, (1590), 13 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:52:34,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:34,648 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:52:34,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:52:34,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:34,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash 148291016, now seen corresponding path program 3 times [2023-11-06 22:52:34,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:34,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667790572] [2023-11-06 22:52:34,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:34,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:36,250 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:52:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667790572] [2023-11-06 22:52:36,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667790572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:36,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:52:36,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258524175] [2023-11-06 22:52:36,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:36,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:52:36,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:36,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:52:36,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:52:37,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 322 [2023-11-06 22:52:37,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 105 transitions, 961 flow. Second operand has 13 states, 13 states have (on average 122.3076923076923) internal successors, (1590), 13 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:52:37,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:52:37,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 322 [2023-11-06 22:52:37,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:52:38,996 INFO L124 PetriNetUnfolderBase]: 248/614 cut-off events. [2023-11-06 22:52:38,997 INFO L125 PetriNetUnfolderBase]: For 2034/2034 co-relation queries the response was YES. [2023-11-06 22:52:38,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2912 conditions, 614 events. 248/614 cut-off events. For 2034/2034 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3551 event pairs, 91 based on Foata normal form. 2/610 useless extension candidates. Maximal degree in co-relation 2884. Up to 364 conditions per place. [2023-11-06 22:52:39,004 INFO L140 encePairwiseOnDemand]: 309/322 looper letters, 108 selfloop transitions, 56 changer transitions 13/177 dead transitions. [2023-11-06 22:52:39,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 177 transitions, 1830 flow [2023-11-06 22:52:39,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:52:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-06 22:52:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1900 transitions. [2023-11-06 22:52:39,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39337474120082816 [2023-11-06 22:52:39,014 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1900 transitions. [2023-11-06 22:52:39,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1900 transitions. [2023-11-06 22:52:39,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:52:39,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1900 transitions. [2023-11-06 22:52:39,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 126.66666666666667) internal successors, (1900), 15 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states 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:52:39,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 322.0) internal successors, (5152), 16 states have internal predecessors, (5152), 0 states have call successors, (0), 0 states 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:52:39,034 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 322.0) internal successors, (5152), 16 states have internal predecessors, (5152), 0 states have call successors, (0), 0 states 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:52:39,034 INFO L175 Difference]: Start difference. First operand has 79 places, 105 transitions, 961 flow. Second operand 15 states and 1900 transitions. [2023-11-06 22:52:39,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 177 transitions, 1830 flow [2023-11-06 22:52:39,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 177 transitions, 1774 flow, removed 27 selfloop flow, removed 2 redundant places. [2023-11-06 22:52:39,054 INFO L231 Difference]: Finished difference. Result has 97 places, 132 transitions, 1396 flow [2023-11-06 22:52:39,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1396, PETRI_PLACES=97, PETRI_TRANSITIONS=132} [2023-11-06 22:52:39,056 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 67 predicate places. [2023-11-06 22:52:39,056 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 132 transitions, 1396 flow [2023-11-06 22:52:39,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 122.3076923076923) internal successors, (1590), 13 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:52:39,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:39,058 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:52:39,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:52:39,058 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:39,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash -192067112, now seen corresponding path program 4 times [2023-11-06 22:52:39,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:39,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174880235] [2023-11-06 22:52:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:40,730 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:52:40,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:40,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174880235] [2023-11-06 22:52:40,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174880235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:40,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:40,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:52:40,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454572500] [2023-11-06 22:52:40,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:40,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:52:40,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:40,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:52:40,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:52:42,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 322 [2023-11-06 22:52:42,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 132 transitions, 1396 flow. Second operand has 13 states, 13 states have (on average 122.3076923076923) internal successors, (1590), 13 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:52:42,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:52:42,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 322 [2023-11-06 22:52:42,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:52:43,512 INFO L124 PetriNetUnfolderBase]: 283/747 cut-off events. [2023-11-06 22:52:43,512 INFO L125 PetriNetUnfolderBase]: For 3405/3405 co-relation queries the response was YES. [2023-11-06 22:52:43,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3747 conditions, 747 events. 283/747 cut-off events. For 3405/3405 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4794 event pairs, 95 based on Foata normal form. 2/740 useless extension candidates. Maximal degree in co-relation 3710. Up to 423 conditions per place. [2023-11-06 22:52:43,521 INFO L140 encePairwiseOnDemand]: 309/322 looper letters, 142 selfloop transitions, 63 changer transitions 13/218 dead transitions. [2023-11-06 22:52:43,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 2526 flow [2023-11-06 22:52:43,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:52:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-06 22:52:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2035 transitions. [2023-11-06 22:52:43,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39499223602484473 [2023-11-06 22:52:43,530 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2035 transitions. [2023-11-06 22:52:43,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2035 transitions. [2023-11-06 22:52:43,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:52:43,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2035 transitions. [2023-11-06 22:52:43,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 127.1875) internal successors, (2035), 16 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states 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:52:43,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 322.0) internal successors, (5474), 17 states have internal predecessors, (5474), 0 states have call successors, (0), 0 states 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:52:43,549 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 322.0) internal successors, (5474), 17 states have internal predecessors, (5474), 0 states have call successors, (0), 0 states 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:52:43,549 INFO L175 Difference]: Start difference. First operand has 97 places, 132 transitions, 1396 flow. Second operand 16 states and 2035 transitions. [2023-11-06 22:52:43,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 218 transitions, 2526 flow [2023-11-06 22:52:43,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 218 transitions, 2423 flow, removed 41 selfloop flow, removed 7 redundant places. [2023-11-06 22:52:43,574 INFO L231 Difference]: Finished difference. Result has 109 places, 162 transitions, 1852 flow [2023-11-06 22:52:43,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1852, PETRI_PLACES=109, PETRI_TRANSITIONS=162} [2023-11-06 22:52:43,575 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2023-11-06 22:52:43,576 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 162 transitions, 1852 flow [2023-11-06 22:52:43,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 122.3076923076923) internal successors, (1590), 13 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:52:43,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:43,577 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:52:43,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:52:43,578 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:43,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1377157804, now seen corresponding path program 5 times [2023-11-06 22:52:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:43,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132147753] [2023-11-06 22:52:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:45,138 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:52:45,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:45,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132147753] [2023-11-06 22:52:45,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132147753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:45,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:45,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:52:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961309008] [2023-11-06 22:52:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:45,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:52:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:45,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:52:45,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:52:46,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 322 [2023-11-06 22:52:46,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 162 transitions, 1852 flow. Second operand has 13 states, 13 states have (on average 122.3076923076923) internal successors, (1590), 13 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:52:46,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:52:46,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 322 [2023-11-06 22:52:46,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:52:48,004 INFO L124 PetriNetUnfolderBase]: 290/777 cut-off events. [2023-11-06 22:52:48,004 INFO L125 PetriNetUnfolderBase]: For 4435/4435 co-relation queries the response was YES. [2023-11-06 22:52:48,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 777 events. 290/777 cut-off events. For 4435/4435 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5077 event pairs, 121 based on Foata normal form. 2/770 useless extension candidates. Maximal degree in co-relation 4064. Up to 505 conditions per place. [2023-11-06 22:52:48,015 INFO L140 encePairwiseOnDemand]: 308/322 looper letters, 137 selfloop transitions, 65 changer transitions 14/216 dead transitions. [2023-11-06 22:52:48,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 216 transitions, 2673 flow [2023-11-06 22:52:48,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:52:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-06 22:52:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2026 transitions. [2023-11-06 22:52:48,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932453416149068 [2023-11-06 22:52:48,027 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2026 transitions. [2023-11-06 22:52:48,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2026 transitions. [2023-11-06 22:52:48,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:52:48,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2026 transitions. [2023-11-06 22:52:48,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 126.625) internal successors, (2026), 16 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states 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:52:48,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 322.0) internal successors, (5474), 17 states have internal predecessors, (5474), 0 states have call successors, (0), 0 states 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:52:48,058 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 322.0) internal successors, (5474), 17 states have internal predecessors, (5474), 0 states have call successors, (0), 0 states 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:52:48,058 INFO L175 Difference]: Start difference. First operand has 109 places, 162 transitions, 1852 flow. Second operand 16 states and 2026 transitions. [2023-11-06 22:52:48,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 216 transitions, 2673 flow [2023-11-06 22:52:48,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 216 transitions, 2548 flow, removed 56 selfloop flow, removed 5 redundant places. [2023-11-06 22:52:48,095 INFO L231 Difference]: Finished difference. Result has 123 places, 173 transitions, 2082 flow [2023-11-06 22:52:48,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2082, PETRI_PLACES=123, PETRI_TRANSITIONS=173} [2023-11-06 22:52:48,097 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2023-11-06 22:52:48,098 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 173 transitions, 2082 flow [2023-11-06 22:52:48,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 122.3076923076923) internal successors, (1590), 13 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states 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:52:48,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:52:48,099 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:52:48,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:52:48,099 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-06 22:52:48,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:48,100 INFO L85 PathProgramCache]: Analyzing trace with hash -384584464, now seen corresponding path program 6 times [2023-11-06 22:52:48,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:48,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890466652] [2023-11-06 22:52:48,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:48,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:48,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:52:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:48,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:52:48,274 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:52:48,276 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 22:52:48,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-06 22:52:48,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-11-06 22:52:48,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-06 22:52:48,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-06 22:52:48,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-11-06 22:52:48,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:52:48,280 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1] [2023-11-06 22:52:48,286 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:52:48,286 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:52:48,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:52:48 BasicIcfg [2023-11-06 22:52:48,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:52:48,369 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:52:48,369 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:52:48,370 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:52:48,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:04" (3/4) ... [2023-11-06 22:52:48,375 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:52:48,452 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:52:48,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:52:48,453 INFO L158 Benchmark]: Toolchain (without parser) took 45725.05ms. Allocated memory was 144.7MB in the beginning and 488.6MB in the end (delta: 343.9MB). Free memory was 99.5MB in the beginning and 169.2MB in the end (delta: -69.7MB). Peak memory consumption was 275.2MB. Max. memory is 16.1GB. [2023-11-06 22:52:48,453 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 100.7MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:52:48,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1284.19ms. Allocated memory is still 144.7MB. Free memory was 99.5MB in the beginning and 82.2MB in the end (delta: 17.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-06 22:52:48,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.61ms. Allocated memory is still 144.7MB. Free memory was 82.2MB in the beginning and 78.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:52:48,455 INFO L158 Benchmark]: Boogie Preprocessor took 50.94ms. Allocated memory is still 144.7MB. Free memory was 78.0MB in the beginning and 75.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:52:48,455 INFO L158 Benchmark]: RCFGBuilder took 703.68ms. Allocated memory is still 144.7MB. Free memory was 75.2MB in the beginning and 51.4MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:52:48,455 INFO L158 Benchmark]: TraceAbstraction took 43492.95ms. Allocated memory was 144.7MB in the beginning and 488.6MB in the end (delta: 343.9MB). Free memory was 50.7MB in the beginning and 175.5MB in the end (delta: -124.8MB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. [2023-11-06 22:52:48,456 INFO L158 Benchmark]: Witness Printer took 83.10ms. Allocated memory is still 488.6MB. Free memory was 175.5MB in the beginning and 169.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:52:48,458 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.34ms. Allocated memory is still 100.7MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1284.19ms. Allocated memory is still 144.7MB. Free memory was 99.5MB in the beginning and 82.2MB in the end (delta: 17.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.61ms. Allocated memory is still 144.7MB. Free memory was 82.2MB in the beginning and 78.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.94ms. Allocated memory is still 144.7MB. Free memory was 78.0MB in the beginning and 75.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 703.68ms. Allocated memory is still 144.7MB. Free memory was 75.2MB in the beginning and 51.4MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 43492.95ms. Allocated memory was 144.7MB in the beginning and 488.6MB in the end (delta: 343.9MB). Free memory was 50.7MB in the beginning and 175.5MB in the end (delta: -124.8MB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. * Witness Printer took 83.10ms. Allocated memory is still 488.6MB. Free memory was 175.5MB in the beginning and 169.2MB 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: 12.7s, 151 PlacesBefore, 30 PlacesAfterwards, 149 TransitionsBefore, 25 TransitionsAfterwards, 2600 CoEnabledTransitionPairs, 6 FixpointIterations, 76 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 157 TotalNumberOfCompositions, 3632 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2096, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1390, independent: 1350, independent conditional: 0, independent unconditional: 1350, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2096, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 1390, unknown conditional: 0, unknown unconditional: 1390] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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; [L1731] CALL, EXPR 0 my_drv_init() [L1725] 0 return 0; [L1731] RET, EXPR 0 my_drv_init() [L1731] 0 int ret = my_drv_init(); [L1732] COND TRUE 0 ret==0 [L1733] 0 int probe_ret; [L1734] 0 struct my_data data; [L1735] CALL, EXPR 0 my_drv_probe(&data) [L1704] 0 struct device *d = &data->dev; [L1706] 0 data->shared.a = 0 [L1707] 0 data->shared.b = 0 [L1708] 0 int res = __VERIFIER_nondet_int(); [L1709] COND FALSE 0 !(\read(res)) [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=7, 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) );}) [L1693] 1 data->shared.a = 1 VAL [arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=8, res=0, t1={3:0}, t2={4:0}] [L1713] 0 return 0; [L1735] RET, EXPR 0 my_drv_probe(&data) [L1735] 0 probe_ret = my_drv_probe(&data) [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) );}) [L1693] 2 data->shared.a = 1 VAL [arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1736] COND TRUE 0 probe_ret==0 [L1737] CALL 0 my_drv_disconnect(&data) [L1719] 0 void *status; [L1720] 0 \read(t1) VAL [\read(t1)=7, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={6:0}, t1={3:0}, t2={4:0}] [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1699] 1 data->shared.b = lb + 1 [L1701] 1 return 0; [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=7, \result={0:0}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, pthread_join(t1, &status)={0:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1721] 0 \read(t2) VAL [\read(t2)=8, \result={0:0}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={6:0}, t1={3:0}, t2={4:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\read(t2)=8, \result={0:0}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, lb=0, pthread_join(t2, &status)={0:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1737] RET 0 my_drv_disconnect(&data) [L1738] EXPR 0 data.shared.a [L1738] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) [L1738] RET 0 ldv_assert(data.shared.a==1) [L1739] EXPR 0 data.shared.b [L1739] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={5:24}, arg={5:24}, data={5:0}, dev={5: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: 1712]: 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: 1711]: 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, 175 locations, 6 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: 43.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2279 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1875 mSDsluCounter, 1979 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1979 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13856 IncrementalHoareTripleChecker+Invalid, 14066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 0 mSDtfsCounter, 13856 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2082occurred in iteration=10, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 2407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:52:48,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc8fc70-4bba-45da-a1f7-4238ae438d9d/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