./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe035_power.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe035_power.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:15:18,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:15:18,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:15:18,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:15:18,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:15:18,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:15:18,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:15:18,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:15:18,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:15:18,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:15:18,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:15:18,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:15:18,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:15:18,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:15:18,858 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:15:18,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:15:18,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:15:18,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:15:18,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:15:18,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:15:18,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:15:18,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:15:18,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:15:18,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:15:18,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:15:18,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:15:18,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:15:18,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:15:18,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:15:18,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:15:18,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:15:18,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:15:18,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:15:18,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:15:18,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:15:18,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:15:18,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:15:18,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:15:18,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:15:18,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:15:18,866 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:15:18,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:15:18,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:15:18,867 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:15:19,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:15:19,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:15:19,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:15:19,211 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:15:19,212 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:15:19,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe035_power.i [2024-02-19 14:15:20,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:15:20,758 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:15:20,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe035_power.i [2024-02-19 14:15:20,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f123e9d5/d02c1026586641ffbb97df649a09d8c9/FLAG69e51882b [2024-02-19 14:15:20,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f123e9d5/d02c1026586641ffbb97df649a09d8c9 [2024-02-19 14:15:20,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:15:20,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:15:20,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:15:20,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:15:20,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:15:20,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:15:20" (1/1) ... [2024-02-19 14:15:20,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d297edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:20, skipping insertion in model container [2024-02-19 14:15:20,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:15:20" (1/1) ... [2024-02-19 14:15:20,853 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:15:21,037 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe035_power.i[947,960] [2024-02-19 14:15:21,305 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:15:21,325 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:15:21,337 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe035_power.i[947,960] [2024-02-19 14:15:21,383 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:15:21,439 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:15:21,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21 WrapperNode [2024-02-19 14:15:21,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:15:21,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:15:21,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:15:21,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:15:21,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,519 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2024-02-19 14:15:21,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:15:21,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:15:21,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:15:21,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:15:21,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,569 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-19 14:15:21,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:15:21,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:15:21,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:15:21,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:15:21,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (1/1) ... [2024-02-19 14:15:21,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:15:21,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:15:21,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 14:15:21,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 14:15:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:15:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:15:21,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:15:21,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:15:21,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:15:21,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:15:21,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:15:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:15:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-19 14:15:21,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-19 14:15:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-19 14:15:21,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-19 14:15:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-19 14:15:21,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-19 14:15:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:15:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:15:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:15:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:15:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:15:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:15:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:15:21,716 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:15:21,907 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:15:21,910 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:15:22,243 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:15:22,243 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:15:22,498 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:15:22,499 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-19 14:15:22,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:15:22 BoogieIcfgContainer [2024-02-19 14:15:22,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:15:22,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:15:22,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:15:22,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:15:22,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:15:20" (1/3) ... [2024-02-19 14:15:22,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651cc960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:15:22, skipping insertion in model container [2024-02-19 14:15:22,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:15:21" (2/3) ... [2024-02-19 14:15:22,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651cc960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:15:22, skipping insertion in model container [2024-02-19 14:15:22,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:15:22" (3/3) ... [2024-02-19 14:15:22,509 INFO L112 eAbstractionObserver]: Analyzing ICFG safe035_power.i [2024-02-19 14:15:22,526 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:15:22,526 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-02-19 14:15:22,526 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:15:22,574 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:15:22,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow [2024-02-19 14:15:22,643 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2024-02-19 14:15:22,644 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:15:22,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-02-19 14:15:22,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow [2024-02-19 14:15:22,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow [2024-02-19 14:15:22,669 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:15:22,676 INFO L369 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=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ca1bb60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:15:22,676 INFO L370 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-19 14:15:22,686 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:15:22,686 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-02-19 14:15:22,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:15:22,686 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:22,687 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:15:22,687 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-19 14:15:22,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash 743793337, now seen corresponding path program 1 times [2024-02-19 14:15:22,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:22,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060097274] [2024-02-19 14:15:22,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:23,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:23,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060097274] [2024-02-19 14:15:23,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060097274] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:23,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:23,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-19 14:15:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61529180] [2024-02-19 14:15:23,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:23,150 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:15:23,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:23,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:15:23,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:15:23,178 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2024-02-19 14:15:23,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:23,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:23,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2024-02-19 14:15:23,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:23,941 INFO L124 PetriNetUnfolderBase]: 1951/3088 cut-off events. [2024-02-19 14:15:23,942 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-19 14:15:23,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 3088 events. 1951/3088 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18990 event pairs, 266 based on Foata normal form. 120/3172 useless extension candidates. Maximal degree in co-relation 5972. Up to 2386 conditions per place. [2024-02-19 14:15:23,965 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 33 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2024-02-19 14:15:23,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 183 flow [2024-02-19 14:15:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:15:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:15:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-02-19 14:15:23,978 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2024-02-19 14:15:23,981 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2024-02-19 14:15:23,982 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 183 flow [2024-02-19 14:15:23,982 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:23,982 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:23,982 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:15:23,982 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:15:23,983 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-19 14:15:23,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1704297118, now seen corresponding path program 1 times [2024-02-19 14:15:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084661076] [2024-02-19 14:15:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:24,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:24,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084661076] [2024-02-19 14:15:24,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084661076] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:24,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:15:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278426068] [2024-02-19 14:15:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:24,282 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:15:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:24,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:15:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:15:24,299 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-02-19 14:15:24,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:24,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:24,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-02-19 14:15:24,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:25,139 INFO L124 PetriNetUnfolderBase]: 3374/5440 cut-off events. [2024-02-19 14:15:25,140 INFO L125 PetriNetUnfolderBase]: For 1028/1043 co-relation queries the response was YES. [2024-02-19 14:15:25,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14553 conditions, 5440 events. 3374/5440 cut-off events. For 1028/1043 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 34167 event pairs, 238 based on Foata normal form. 210/5494 useless extension candidates. Maximal degree in co-relation 14539. Up to 3547 conditions per place. [2024-02-19 14:15:25,171 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 79 selfloop transitions, 5 changer transitions 3/96 dead transitions. [2024-02-19 14:15:25,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 96 transitions, 533 flow [2024-02-19 14:15:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:15:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:15:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-02-19 14:15:25,174 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2024-02-19 14:15:25,175 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-02-19 14:15:25,175 INFO L507 AbstractCegarLoop]: Abstraction has has 52 places, 96 transitions, 533 flow [2024-02-19 14:15:25,175 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:25,175 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:25,176 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:15:25,176 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:15:25,176 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-19 14:15:25,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash 3938819, now seen corresponding path program 1 times [2024-02-19 14:15:25,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:25,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579996740] [2024-02-19 14:15:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:25,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579996740] [2024-02-19 14:15:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579996740] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:25,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:25,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:15:25,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990981165] [2024-02-19 14:15:25,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:25,420 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:15:25,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:25,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:15:25,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:15:25,431 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-02-19 14:15:25,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 96 transitions, 533 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:25,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:25,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-02-19 14:15:25,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:26,160 INFO L124 PetriNetUnfolderBase]: 2251/3621 cut-off events. [2024-02-19 14:15:26,160 INFO L125 PetriNetUnfolderBase]: For 1064/1134 co-relation queries the response was YES. [2024-02-19 14:15:26,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13327 conditions, 3621 events. 2251/3621 cut-off events. For 1064/1134 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 20356 event pairs, 142 based on Foata normal form. 152/3707 useless extension candidates. Maximal degree in co-relation 13310. Up to 2389 conditions per place. [2024-02-19 14:15:26,182 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 92 selfloop transitions, 8 changer transitions 43/152 dead transitions. [2024-02-19 14:15:26,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 152 transitions, 1138 flow [2024-02-19 14:15:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:15:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:15:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-02-19 14:15:26,187 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-02-19 14:15:26,188 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2024-02-19 14:15:26,188 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 152 transitions, 1138 flow [2024-02-19 14:15:26,188 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:26,188 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:26,189 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:15:26,189 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:15:26,189 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-19 14:15:26,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:26,190 INFO L85 PathProgramCache]: Analyzing trace with hash -545191794, now seen corresponding path program 1 times [2024-02-19 14:15:26,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:26,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071397940] [2024-02-19 14:15:26,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:26,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:26,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071397940] [2024-02-19 14:15:26,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071397940] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:26,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:26,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:15:26,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639679665] [2024-02-19 14:15:26,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:26,513 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:15:26,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:26,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:15:26,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:15:26,520 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-02-19 14:15:26,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 152 transitions, 1138 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:26,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:26,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-02-19 14:15:26,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:27,011 INFO L124 PetriNetUnfolderBase]: 1775/2769 cut-off events. [2024-02-19 14:15:27,011 INFO L125 PetriNetUnfolderBase]: For 990/1088 co-relation queries the response was YES. [2024-02-19 14:15:27,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13142 conditions, 2769 events. 1775/2769 cut-off events. For 990/1088 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14683 event pairs, 126 based on Foata normal form. 58/2809 useless extension candidates. Maximal degree in co-relation 13122. Up to 1781 conditions per place. [2024-02-19 14:15:27,028 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 75 selfloop transitions, 11 changer transitions 66/161 dead transitions. [2024-02-19 14:15:27,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 161 transitions, 1512 flow [2024-02-19 14:15:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:15:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:15:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-02-19 14:15:27,030 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-19 14:15:27,031 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2024-02-19 14:15:27,032 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 161 transitions, 1512 flow [2024-02-19 14:15:27,032 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:27,032 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:27,032 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:15:27,032 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:15:27,033 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-19 14:15:27,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1266268168, now seen corresponding path program 1 times [2024-02-19 14:15:27,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:27,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835917243] [2024-02-19 14:15:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:28,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:28,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835917243] [2024-02-19 14:15:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835917243] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:28,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:28,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-19 14:15:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18253190] [2024-02-19 14:15:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:28,973 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 14:15:28,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:28,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 14:15:28,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:15:28,989 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-19 14:15:28,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 161 transitions, 1512 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:28,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:28,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-19 14:15:28,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:29,926 INFO L124 PetriNetUnfolderBase]: 3269/5111 cut-off events. [2024-02-19 14:15:29,927 INFO L125 PetriNetUnfolderBase]: For 5994/6063 co-relation queries the response was YES. [2024-02-19 14:15:29,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27759 conditions, 5111 events. 3269/5111 cut-off events. For 5994/6063 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 29116 event pairs, 114 based on Foata normal form. 9/5111 useless extension candidates. Maximal degree in co-relation 27736. Up to 3210 conditions per place. [2024-02-19 14:15:29,954 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 96 selfloop transitions, 8 changer transitions 164/290 dead transitions. [2024-02-19 14:15:29,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 290 transitions, 3334 flow [2024-02-19 14:15:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 14:15:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 14:15:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-02-19 14:15:29,956 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2024-02-19 14:15:29,957 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2024-02-19 14:15:29,957 INFO L507 AbstractCegarLoop]: Abstraction has has 68 places, 290 transitions, 3334 flow [2024-02-19 14:15:29,957 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:29,957 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:29,957 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:15:29,958 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:15:29,958 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-19 14:15:29,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash -934515398, now seen corresponding path program 2 times [2024-02-19 14:15:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286413538] [2024-02-19 14:15:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:30,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286413538] [2024-02-19 14:15:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286413538] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:30,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:30,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:15:30,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732291206] [2024-02-19 14:15:30,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:30,269 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:15:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:30,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:15:30,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:15:30,277 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-02-19 14:15:30,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 290 transitions, 3334 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:30,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:30,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-02-19 14:15:30,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:31,651 INFO L124 PetriNetUnfolderBase]: 6525/10052 cut-off events. [2024-02-19 14:15:31,652 INFO L125 PetriNetUnfolderBase]: For 32163/32622 co-relation queries the response was YES. [2024-02-19 14:15:31,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61841 conditions, 10052 events. 6525/10052 cut-off events. For 32163/32622 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 61374 event pairs, 229 based on Foata normal form. 136/10151 useless extension candidates. Maximal degree in co-relation 61815. Up to 6510 conditions per place. [2024-02-19 14:15:31,699 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 103 selfloop transitions, 1 changer transitions 420/544 dead transitions. [2024-02-19 14:15:31,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 544 transitions, 7426 flow [2024-02-19 14:15:31,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:15:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:15:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-02-19 14:15:31,701 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5674603174603174 [2024-02-19 14:15:31,702 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2024-02-19 14:15:31,702 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 544 transitions, 7426 flow [2024-02-19 14:15:31,702 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:31,702 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:31,702 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:15:31,703 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:15:31,703 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-19 14:15:31,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1039582212, now seen corresponding path program 3 times [2024-02-19 14:15:31,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:31,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93669777] [2024-02-19 14:15:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:33,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:33,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93669777] [2024-02-19 14:15:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93669777] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:33,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-02-19 14:15:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121217780] [2024-02-19 14:15:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:33,602 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-19 14:15:33,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:33,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-19 14:15:33,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-02-19 14:15:33,624 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-19 14:15:33,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 544 transitions, 7426 flow. Second operand has 13 states, 13 states have (on average 15.692307692307692) internal successors, (204), 13 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:33,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:33,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-19 14:15:33,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:37,127 INFO L124 PetriNetUnfolderBase]: 14541/22550 cut-off events. [2024-02-19 14:15:37,128 INFO L125 PetriNetUnfolderBase]: For 109488/110262 co-relation queries the response was YES. [2024-02-19 14:15:37,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154861 conditions, 22550 events. 14541/22550 cut-off events. For 109488/110262 co-relation queries the response was YES. Maximal size of possible extension queue 1094. Compared 158937 event pairs, 375 based on Foata normal form. 309/22797 useless extension candidates. Maximal degree in co-relation 154832. Up to 15532 conditions per place. [2024-02-19 14:15:37,439 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 142 selfloop transitions, 38 changer transitions 1279/1478 dead transitions. [2024-02-19 14:15:37,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 1478 transitions, 23393 flow [2024-02-19 14:15:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-19 14:15:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-19 14:15:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 383 transitions. [2024-02-19 14:15:37,442 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5364145658263305 [2024-02-19 14:15:37,443 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 41 predicate places. [2024-02-19 14:15:37,444 INFO L507 AbstractCegarLoop]: Abstraction has has 89 places, 1478 transitions, 23393 flow [2024-02-19 14:15:37,444 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.692307692307692) internal successors, (204), 13 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:37,444 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:37,444 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:15:37,444 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 14:15:37,444 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-19 14:15:37,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:37,445 INFO L85 PathProgramCache]: Analyzing trace with hash 786216832, now seen corresponding path program 4 times [2024-02-19 14:15:37,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:37,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3463156] [2024-02-19 14:15:37,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:37,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:39,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:39,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3463156] [2024-02-19 14:15:39,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3463156] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:39,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:39,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:15:39,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752140906] [2024-02-19 14:15:39,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:39,030 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-19 14:15:39,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:39,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-19 14:15:39,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-19 14:15:39,040 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-19 14:15:39,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 1478 transitions, 23393 flow. Second operand has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:39,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:39,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-19 14:15:39,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:15:49,914 INFO L124 PetriNetUnfolderBase]: 35021/54642 cut-off events. [2024-02-19 14:15:49,914 INFO L125 PetriNetUnfolderBase]: For 387661/389764 co-relation queries the response was YES. [2024-02-19 14:15:50,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413285 conditions, 54642 events. 35021/54642 cut-off events. For 387661/389764 co-relation queries the response was YES. Maximal size of possible extension queue 2793. Compared 442547 event pairs, 750 based on Foata normal form. 811/55383 useless extension candidates. Maximal degree in co-relation 413253. Up to 38347 conditions per place. [2024-02-19 14:15:50,215 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 156 selfloop transitions, 16 changer transitions 3523/3714 dead transitions. [2024-02-19 14:15:50,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 3714 transitions, 66520 flow [2024-02-19 14:15:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-19 14:15:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-19 14:15:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 441 transitions. [2024-02-19 14:15:50,218 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2024-02-19 14:15:50,220 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 59 predicate places. [2024-02-19 14:15:50,220 INFO L507 AbstractCegarLoop]: Abstraction has has 107 places, 3714 transitions, 66520 flow [2024-02-19 14:15:50,221 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:50,221 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:15:50,221 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:15:50,221 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 14:15:50,221 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-19 14:15:50,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:15:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1514366558, now seen corresponding path program 5 times [2024-02-19 14:15:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:15:50,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106306249] [2024-02-19 14:15:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:15:50,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:15:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:15:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:15:52,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:15:52,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106306249] [2024-02-19 14:15:52,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106306249] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:15:52,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:15:52,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:15:52,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628383301] [2024-02-19 14:15:52,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:15:52,309 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-19 14:15:52,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:15:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-19 14:15:52,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-02-19 14:15:52,325 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-19 14:15:52,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 3714 transitions, 66520 flow. Second operand has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:15:52,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:15:52,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-19 14:15:52,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:16:16,418 INFO L124 PetriNetUnfolderBase]: 44672/69787 cut-off events. [2024-02-19 14:16:16,418 INFO L125 PetriNetUnfolderBase]: For 676275/678219 co-relation queries the response was YES. [2024-02-19 14:16:16,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578076 conditions, 69787 events. 44672/69787 cut-off events. For 676275/678219 co-relation queries the response was YES. Maximal size of possible extension queue 3717. Compared 586194 event pairs, 926 based on Foata normal form. 809/70536 useless extension candidates. Maximal degree in co-relation 578041. Up to 49207 conditions per place. [2024-02-19 14:16:16,771 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 154 selfloop transitions, 23 changer transitions 4934/5130 dead transitions. [2024-02-19 14:16:16,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 5130 transitions, 102128 flow [2024-02-19 14:16:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 14:16:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 14:16:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-02-19 14:16:16,773 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2024-02-19 14:16:16,775 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 67 predicate places. [2024-02-19 14:16:16,775 INFO L507 AbstractCegarLoop]: Abstraction has has 115 places, 5130 transitions, 102128 flow [2024-02-19 14:16:16,776 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:16:16,776 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:16:16,776 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:16:16,776 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 14:16:16,777 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-19 14:16:16,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:16:16,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1501599940, now seen corresponding path program 6 times [2024-02-19 14:16:16,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:16:16,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841127635] [2024-02-19 14:16:16,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:16:16,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:16:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:16:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:16:18,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:16:18,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841127635] [2024-02-19 14:16:18,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841127635] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:16:18,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:16:18,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-19 14:16:18,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568461232] [2024-02-19 14:16:18,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:16:18,947 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-19 14:16:18,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:16:18,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-19 14:16:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-02-19 14:16:18,963 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-19 14:16:18,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 5130 transitions, 102128 flow. Second operand has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:16:18,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:16:18,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-19 14:16:18,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand