./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.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 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:15:50,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:15:50,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:15:51,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:15:51,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:15:51,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:15:51,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:15:51,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:15:51,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:15:51,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:15:51,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:15:51,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:15:51,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:15:51,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:15:51,051 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:15:51,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:15:51,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:15:51,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:15:51,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:15:51,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:15:51,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:15:51,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:15:51,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:15:51,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:15:51,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:15:51,057 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:15:51,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:15:51,057 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:15:51,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:15:51,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:15:51,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:15:51,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:15:51,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:15:51,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:15:51,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:15:51,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:15:51,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:15:51,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:15:51,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:15:51,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:15:51,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:15:51,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:15:51,060 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 -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd [2024-11-10 10:15:51,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:15:51,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:15:51,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:15:51,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:15:51,279 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:15:51,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2024-11-10 10:15:52,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:15:53,131 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:15:53,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2024-11-10 10:15:53,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1762c82fc/63501bf8a20049dc981e0084a09f64a3/FLAG2eed3eca8 [2024-11-10 10:15:53,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1762c82fc/63501bf8a20049dc981e0084a09f64a3 [2024-11-10 10:15:53,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:15:53,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:15:53,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:15:53,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:15:53,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:15:53,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:53,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eda8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53, skipping insertion in model container [2024-11-10 10:15:53,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:53,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:15:53,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2024-11-10 10:15:53,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:15:53,863 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:15:53,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2024-11-10 10:15:53,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:15:53,955 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:15:53,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53 WrapperNode [2024-11-10 10:15:53,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:15:53,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:15:53,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:15:53,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:15:53,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:53,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,040 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-11-10 10:15:54,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:15:54,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:15:54,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:15:54,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:15:54,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,102 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 10:15:54,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:15:54,114 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:15:54,114 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:15:54,114 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:15:54,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (1/1) ... [2024-11-10 10:15:54,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:15:54,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:15:54,160 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-11-10 10:15:54,163 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-11-10 10:15:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 10:15:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:15:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 10:15:54,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 10:15:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 10:15:54,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 10:15:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 10:15:54,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 10:15:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-10 10:15:54,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-10 10:15:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:15:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 10:15:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:15:54,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:15:54,201 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:15:54,325 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:15:54,328 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:15:54,576 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:15:54,576 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:15:54,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:15:54,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:15:54,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:15:54 BoogieIcfgContainer [2024-11-10 10:15:54,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:15:54,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:15:54,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:15:54,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:15:54,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:15:53" (1/3) ... [2024-11-10 10:15:54,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245708f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:15:54, skipping insertion in model container [2024-11-10 10:15:54,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:15:53" (2/3) ... [2024-11-10 10:15:54,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245708f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:15:54, skipping insertion in model container [2024-11-10 10:15:54,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:15:54" (3/3) ... [2024-11-10 10:15:54,725 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2024-11-10 10:15:54,737 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:15:54,738 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:15:54,738 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:15:54,783 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:15:54,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2024-11-10 10:15:54,851 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-11-10 10:15:54,853 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:15:54,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2024-11-10 10:15:54,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2024-11-10 10:15:54,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2024-11-10 10:15:54,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:15:54,878 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3b5b83fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:15:54,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 10:15:54,891 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:15:54,891 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-10 10:15:54,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:15:54,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:15:54,892 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:15:54,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:15:54,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:15:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash -279600374, now seen corresponding path program 1 times [2024-11-10 10:15:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:15:54,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230842563] [2024-11-10 10:15:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:15:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:15:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:15:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:15:55,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:15:55,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230842563] [2024-11-10 10:15:55,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230842563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:15:55,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:15:55,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 10:15:55,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417235046] [2024-11-10 10:15:55,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:15:55,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:15:55,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:15:55,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:15:55,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:15:55,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 10:15:55,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-11-10 10:15:55,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:15:55,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 10:15:55,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:15:59,376 INFO L124 PetriNetUnfolderBase]: 38795/51447 cut-off events. [2024-11-10 10:15:59,376 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2024-11-10 10:15:59,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102947 conditions, 51447 events. 38795/51447 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 1537. Compared 295496 event pairs, 5855 based on Foata normal form. 1296/52716 useless extension candidates. Maximal degree in co-relation 102935. Up to 42661 conditions per place. [2024-11-10 10:15:59,671 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 55 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2024-11-10 10:15:59,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 260 flow [2024-11-10 10:15:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:15:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:15:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-10 10:15:59,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-10 10:15:59,681 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 92 transitions. [2024-11-10 10:15:59,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 260 flow [2024-11-10 10:15:59,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 256 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 10:15:59,693 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2024-11-10 10:15:59,695 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-11-10 10:15:59,701 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2024-11-10 10:15:59,703 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2024-11-10 10:15:59,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-11-10 10:15:59,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:15:59,704 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:15:59,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:15:59,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:15:59,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:15:59,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1576607217, now seen corresponding path program 1 times [2024-11-10 10:15:59,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:15:59,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429310629] [2024-11-10 10:15:59,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:15:59,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:15:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:15:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:15:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:15:59,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429310629] [2024-11-10 10:15:59,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429310629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:15:59,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:15:59,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:15:59,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021386077] [2024-11-10 10:15:59,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:15:59,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:15:59,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:15:59,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:15:59,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:15:59,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 10:15:59,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-11-10 10:15:59,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:15:59,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 10:15:59,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:04,406 INFO L124 PetriNetUnfolderBase]: 49475/66489 cut-off events. [2024-11-10 10:16:04,406 INFO L125 PetriNetUnfolderBase]: For 2544/2544 co-relation queries the response was YES. [2024-11-10 10:16:04,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134811 conditions, 66489 events. 49475/66489 cut-off events. For 2544/2544 co-relation queries the response was YES. Maximal size of possible extension queue 2045. Compared 414469 event pairs, 9199 based on Foata normal form. 0/65260 useless extension candidates. Maximal degree in co-relation 134801. Up to 43215 conditions per place. [2024-11-10 10:16:04,645 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 55 selfloop transitions, 3 changer transitions 92/155 dead transitions. [2024-11-10 10:16:04,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 155 transitions, 640 flow [2024-11-10 10:16:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:16:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:16:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 224 transitions. [2024-11-10 10:16:04,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-10 10:16:04,648 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 8 states and 224 transitions. [2024-11-10 10:16:04,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 155 transitions, 640 flow [2024-11-10 10:16:04,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 155 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:16:04,654 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 123 flow [2024-11-10 10:16:04,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-11-10 10:16:04,655 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2024-11-10 10:16:04,655 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 123 flow [2024-11-10 10:16:04,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-11-10 10:16:04,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:04,656 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:16:04,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:16:04,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:04,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash 552718630, now seen corresponding path program 1 times [2024-11-10 10:16:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:04,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482011569] [2024-11-10 10:16:04,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:04,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:04,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482011569] [2024-11-10 10:16:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482011569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:04,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:04,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:16:04,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802421789] [2024-11-10 10:16:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:04,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:16:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:16:04,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:16:04,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 10:16:04,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-11-10 10:16:04,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:04,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 10:16:04,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:07,738 INFO L124 PetriNetUnfolderBase]: 31203/42760 cut-off events. [2024-11-10 10:16:07,742 INFO L125 PetriNetUnfolderBase]: For 15714/15714 co-relation queries the response was YES. [2024-11-10 10:16:07,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98797 conditions, 42760 events. 31203/42760 cut-off events. For 15714/15714 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 256763 event pairs, 3565 based on Foata normal form. 1296/44039 useless extension candidates. Maximal degree in co-relation 98782. Up to 25489 conditions per place. [2024-11-10 10:16:08,124 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 78 selfloop transitions, 6 changer transitions 1/90 dead transitions. [2024-11-10 10:16:08,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 431 flow [2024-11-10 10:16:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:16:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:16:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-11-10 10:16:08,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6302083333333334 [2024-11-10 10:16:08,130 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 123 flow. Second operand 4 states and 121 transitions. [2024-11-10 10:16:08,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 90 transitions, 431 flow [2024-11-10 10:16:08,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 420 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-10 10:16:08,495 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 158 flow [2024-11-10 10:16:08,495 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-10 10:16:08,496 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-11-10 10:16:08,496 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 158 flow [2024-11-10 10:16:08,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-11-10 10:16:08,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:08,497 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:16:08,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:16:08,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:08,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash 691200270, now seen corresponding path program 1 times [2024-11-10 10:16:08,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:08,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404894564] [2024-11-10 10:16:08,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:08,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:08,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404894564] [2024-11-10 10:16:08,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404894564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:08,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:08,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:16:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804318556] [2024-11-10 10:16:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:08,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:16:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:16:08,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:16:08,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 10:16:08,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-11-10 10:16:08,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:08,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 10:16:08,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:13,636 INFO L124 PetriNetUnfolderBase]: 52473/71403 cut-off events. [2024-11-10 10:16:13,637 INFO L125 PetriNetUnfolderBase]: For 31873/31873 co-relation queries the response was YES. [2024-11-10 10:16:13,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178439 conditions, 71403 events. 52473/71403 cut-off events. For 31873/31873 co-relation queries the response was YES. Maximal size of possible extension queue 2193. Compared 448758 event pairs, 18977 based on Foata normal form. 1432/72804 useless extension candidates. Maximal degree in co-relation 178423. Up to 38601 conditions per place. [2024-11-10 10:16:14,036 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 68 selfloop transitions, 8 changer transitions 75/156 dead transitions. [2024-11-10 10:16:14,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 156 transitions, 791 flow [2024-11-10 10:16:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:16:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:16:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2024-11-10 10:16:14,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6101190476190477 [2024-11-10 10:16:14,038 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 158 flow. Second operand 7 states and 205 transitions. [2024-11-10 10:16:14,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 156 transitions, 791 flow [2024-11-10 10:16:14,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 156 transitions, 774 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-10 10:16:14,053 INFO L231 Difference]: Finished difference. Result has 68 places, 52 transitions, 241 flow [2024-11-10 10:16:14,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2024-11-10 10:16:14,054 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2024-11-10 10:16:14,054 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 241 flow [2024-11-10 10:16:14,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-11-10 10:16:14,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:14,055 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:16:14,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:16:14,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:14,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2006809700, now seen corresponding path program 1 times [2024-11-10 10:16:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:14,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398189822] [2024-11-10 10:16:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:14,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:14,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398189822] [2024-11-10 10:16:14,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398189822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:14,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:14,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:16:14,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298406422] [2024-11-10 10:16:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:14,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:16:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:14,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:16:14,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:16:14,368 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 10:16:14,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-11-10 10:16:14,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:14,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 10:16:14,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:17,432 INFO L124 PetriNetUnfolderBase]: 32477/45138 cut-off events. [2024-11-10 10:16:17,432 INFO L125 PetriNetUnfolderBase]: For 66584/66584 co-relation queries the response was YES. [2024-11-10 10:16:17,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129140 conditions, 45138 events. 32477/45138 cut-off events. For 66584/66584 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 274646 event pairs, 3229 based on Foata normal form. 1768/46885 useless extension candidates. Maximal degree in co-relation 129118. Up to 18957 conditions per place. [2024-11-10 10:16:17,683 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 119 selfloop transitions, 10 changer transitions 1/135 dead transitions. [2024-11-10 10:16:17,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 135 transitions, 910 flow [2024-11-10 10:16:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:16:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:16:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-10 10:16:17,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-11-10 10:16:17,691 INFO L175 Difference]: Start difference. First operand has 68 places, 52 transitions, 241 flow. Second operand 5 states and 156 transitions. [2024-11-10 10:16:17,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 135 transitions, 910 flow [2024-11-10 10:16:17,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 135 transitions, 854 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-10 10:16:17,784 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 282 flow [2024-11-10 10:16:17,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-11-10 10:16:17,785 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2024-11-10 10:16:17,785 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 282 flow [2024-11-10 10:16:17,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-11-10 10:16:17,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:17,785 INFO L204 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-11-10 10:16:17,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:16:17,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:17,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash -275560721, now seen corresponding path program 1 times [2024-11-10 10:16:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:17,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408602994] [2024-11-10 10:16:17,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:17,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:17,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:17,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408602994] [2024-11-10 10:16:17,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408602994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:17,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:17,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:16:17,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039418295] [2024-11-10 10:16:17,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:17,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:16:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:17,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:16:17,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:16:17,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 10:16:17,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-11-10 10:16:17,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:17,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 10:16:17,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:20,120 INFO L124 PetriNetUnfolderBase]: 19557/27154 cut-off events. [2024-11-10 10:16:20,121 INFO L125 PetriNetUnfolderBase]: For 45480/45480 co-relation queries the response was YES. [2024-11-10 10:16:20,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82502 conditions, 27154 events. 19557/27154 cut-off events. For 45480/45480 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 153098 event pairs, 2329 based on Foata normal form. 944/28077 useless extension candidates. Maximal degree in co-relation 82480. Up to 8360 conditions per place. [2024-11-10 10:16:20,245 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 139 selfloop transitions, 14 changer transitions 2/160 dead transitions. [2024-11-10 10:16:20,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 160 transitions, 1072 flow [2024-11-10 10:16:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:16:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:16:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-10 10:16:20,246 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-10 10:16:20,247 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 282 flow. Second operand 6 states and 189 transitions. [2024-11-10 10:16:20,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 160 transitions, 1072 flow [2024-11-10 10:16:20,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 160 transitions, 1042 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 10:16:20,455 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 332 flow [2024-11-10 10:16:20,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2024-11-10 10:16:20,456 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-11-10 10:16:20,457 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 332 flow [2024-11-10 10:16:20,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-11-10 10:16:20,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:20,457 INFO L204 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] [2024-11-10 10:16:20,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:16:20,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:20,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1537598394, now seen corresponding path program 1 times [2024-11-10 10:16:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146624349] [2024-11-10 10:16:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:20,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146624349] [2024-11-10 10:16:20,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146624349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:20,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:20,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:16:20,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773361727] [2024-11-10 10:16:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:20,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:16:20,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:20,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:16:20,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:16:20,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 10:16:20,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-11-10 10:16:20,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:20,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 10:16:20,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:24,210 INFO L124 PetriNetUnfolderBase]: 27041/37547 cut-off events. [2024-11-10 10:16:24,210 INFO L125 PetriNetUnfolderBase]: For 62932/62932 co-relation queries the response was YES. [2024-11-10 10:16:24,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116272 conditions, 37547 events. 27041/37547 cut-off events. For 62932/62932 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 219230 event pairs, 3179 based on Foata normal form. 152/37678 useless extension candidates. Maximal degree in co-relation 116249. Up to 13536 conditions per place. [2024-11-10 10:16:24,411 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 140 selfloop transitions, 16 changer transitions 71/232 dead transitions. [2024-11-10 10:16:24,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 232 transitions, 1724 flow [2024-11-10 10:16:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:16:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:16:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 244 transitions. [2024-11-10 10:16:24,413 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2024-11-10 10:16:24,413 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 332 flow. Second operand 8 states and 244 transitions. [2024-11-10 10:16:24,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 232 transitions, 1724 flow [2024-11-10 10:16:24,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 232 transitions, 1535 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-11-10 10:16:24,855 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 384 flow [2024-11-10 10:16:24,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=384, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2024-11-10 10:16:24,855 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places. [2024-11-10 10:16:24,856 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 384 flow [2024-11-10 10:16:24,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-11-10 10:16:24,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:24,856 INFO L204 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] [2024-11-10 10:16:24,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:16:24,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:24,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1841182780, now seen corresponding path program 2 times [2024-11-10 10:16:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:24,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780223324] [2024-11-10 10:16:24,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:25,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780223324] [2024-11-10 10:16:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780223324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:25,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:25,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:16:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748874870] [2024-11-10 10:16:25,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:25,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:16:25,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:16:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:16:25,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 10:16:25,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 384 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-11-10 10:16:25,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:25,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 10:16:25,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:26,932 INFO L124 PetriNetUnfolderBase]: 19117/26540 cut-off events. [2024-11-10 10:16:26,932 INFO L125 PetriNetUnfolderBase]: For 50527/50527 co-relation queries the response was YES. [2024-11-10 10:16:27,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80352 conditions, 26540 events. 19117/26540 cut-off events. For 50527/50527 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 153653 event pairs, 2427 based on Foata normal form. 392/26917 useless extension candidates. Maximal degree in co-relation 80326. Up to 9196 conditions per place. [2024-11-10 10:16:27,062 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 123 selfloop transitions, 18 changer transitions 17/163 dead transitions. [2024-11-10 10:16:27,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 163 transitions, 1218 flow [2024-11-10 10:16:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:16:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:16:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2024-11-10 10:16:27,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2024-11-10 10:16:27,068 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 384 flow. Second operand 7 states and 188 transitions. [2024-11-10 10:16:27,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 163 transitions, 1218 flow [2024-11-10 10:16:27,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 163 transitions, 1132 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-11-10 10:16:27,594 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 364 flow [2024-11-10 10:16:27,595 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2024-11-10 10:16:27,598 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2024-11-10 10:16:27,599 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 364 flow [2024-11-10 10:16:27,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-11-10 10:16:27,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:27,599 INFO L204 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, 1, 1, 1, 1] [2024-11-10 10:16:27,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:16:27,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:27,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1811848771, now seen corresponding path program 1 times [2024-11-10 10:16:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:27,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159523695] [2024-11-10 10:16:27,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:28,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159523695] [2024-11-10 10:16:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159523695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:28,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:28,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:16:28,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104710003] [2024-11-10 10:16:28,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:28,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:16:28,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:28,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:16:28,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:16:28,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 10:16:28,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-11-10 10:16:28,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:28,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 10:16:28,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:30,277 INFO L124 PetriNetUnfolderBase]: 16389/22903 cut-off events. [2024-11-10 10:16:30,280 INFO L125 PetriNetUnfolderBase]: For 38238/38238 co-relation queries the response was YES. [2024-11-10 10:16:30,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71663 conditions, 22903 events. 16389/22903 cut-off events. For 38238/38238 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 131760 event pairs, 3453 based on Foata normal form. 16/22916 useless extension candidates. Maximal degree in co-relation 71637. Up to 11670 conditions per place. [2024-11-10 10:16:30,534 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 98 selfloop transitions, 17 changer transitions 34/154 dead transitions. [2024-11-10 10:16:30,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 154 transitions, 1139 flow [2024-11-10 10:16:30,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:16:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:16:30,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-11-10 10:16:30,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5029761904761905 [2024-11-10 10:16:30,539 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 364 flow. Second operand 7 states and 169 transitions. [2024-11-10 10:16:30,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 154 transitions, 1139 flow [2024-11-10 10:16:30,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 154 transitions, 870 flow, removed 56 selfloop flow, removed 13 redundant places. [2024-11-10 10:16:30,890 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 399 flow [2024-11-10 10:16:30,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=399, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2024-11-10 10:16:30,892 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2024-11-10 10:16:30,892 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 399 flow [2024-11-10 10:16:30,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-11-10 10:16:30,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:30,893 INFO L204 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, 1, 1, 1, 1] [2024-11-10 10:16:30,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:16:30,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:30,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:30,894 INFO L85 PathProgramCache]: Analyzing trace with hash 585114435, now seen corresponding path program 2 times [2024-11-10 10:16:30,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:30,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407746581] [2024-11-10 10:16:30,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:30,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:31,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:31,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407746581] [2024-11-10 10:16:31,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407746581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:31,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:31,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:16:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962554941] [2024-11-10 10:16:31,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:31,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:16:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:16:31,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:16:31,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 10:16:31,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 399 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-11-10 10:16:31,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:31,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 10:16:31,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:33,513 INFO L124 PetriNetUnfolderBase]: 22111/31081 cut-off events. [2024-11-10 10:16:33,513 INFO L125 PetriNetUnfolderBase]: For 34719/34719 co-relation queries the response was YES. [2024-11-10 10:16:33,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85476 conditions, 31081 events. 22111/31081 cut-off events. For 34719/34719 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 186692 event pairs, 3867 based on Foata normal form. 16/31094 useless extension candidates. Maximal degree in co-relation 85453. Up to 14364 conditions per place. [2024-11-10 10:16:33,628 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 79 selfloop transitions, 10 changer transitions 94/188 dead transitions. [2024-11-10 10:16:33,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 188 transitions, 1189 flow [2024-11-10 10:16:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:16:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:16:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-10 10:16:33,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-11-10 10:16:33,630 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 399 flow. Second operand 8 states and 198 transitions. [2024-11-10 10:16:33,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 188 transitions, 1189 flow [2024-11-10 10:16:33,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 188 transitions, 1183 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-10 10:16:33,653 INFO L231 Difference]: Finished difference. Result has 80 places, 60 transitions, 303 flow [2024-11-10 10:16:33,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=303, PETRI_PLACES=80, PETRI_TRANSITIONS=60} [2024-11-10 10:16:33,653 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2024-11-10 10:16:33,654 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 303 flow [2024-11-10 10:16:33,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-11-10 10:16:33,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:33,654 INFO L204 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, 1, 1, 1, 1] [2024-11-10 10:16:33,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:16:33,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:33,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1058518915, now seen corresponding path program 3 times [2024-11-10 10:16:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:33,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505439155] [2024-11-10 10:16:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:33,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:33,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505439155] [2024-11-10 10:16:33,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505439155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:33,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:33,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:16:33,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831410341] [2024-11-10 10:16:33,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:33,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:16:33,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:33,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:16:33,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:16:33,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 10:16:33,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 60 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-11-10 10:16:33,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:33,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 10:16:33,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:35,173 INFO L124 PetriNetUnfolderBase]: 13531/19221 cut-off events. [2024-11-10 10:16:35,174 INFO L125 PetriNetUnfolderBase]: For 22580/22580 co-relation queries the response was YES. [2024-11-10 10:16:35,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51847 conditions, 19221 events. 13531/19221 cut-off events. For 22580/22580 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 110411 event pairs, 4553 based on Foata normal form. 16/19235 useless extension candidates. Maximal degree in co-relation 51821. Up to 12360 conditions per place. [2024-11-10 10:16:35,237 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 53 selfloop transitions, 4 changer transitions 50/112 dead transitions. [2024-11-10 10:16:35,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 112 transitions, 679 flow [2024-11-10 10:16:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:16:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:16:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-11-10 10:16:35,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-11-10 10:16:35,238 INFO L175 Difference]: Start difference. First operand has 80 places, 60 transitions, 303 flow. Second operand 6 states and 134 transitions. [2024-11-10 10:16:35,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 112 transitions, 679 flow [2024-11-10 10:16:35,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 112 transitions, 610 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-11-10 10:16:35,256 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 199 flow [2024-11-10 10:16:35,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2024-11-10 10:16:35,256 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2024-11-10 10:16:35,256 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 199 flow [2024-11-10 10:16:35,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-11-10 10:16:35,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:35,257 INFO L204 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, 1, 1, 1, 1] [2024-11-10 10:16:35,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:16:35,257 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:35,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1371091203, now seen corresponding path program 4 times [2024-11-10 10:16:35,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:35,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898973069] [2024-11-10 10:16:35,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:35,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:35,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:35,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898973069] [2024-11-10 10:16:35,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898973069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:35,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:35,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:16:35,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147025857] [2024-11-10 10:16:35,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:35,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:16:35,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:35,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:16:35,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:16:35,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 10:16:35,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 52 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-11-10 10:16:35,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:35,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 10:16:35,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:36,674 INFO L124 PetriNetUnfolderBase]: 4103/5926 cut-off events. [2024-11-10 10:16:36,674 INFO L125 PetriNetUnfolderBase]: For 2126/2126 co-relation queries the response was YES. [2024-11-10 10:16:36,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13973 conditions, 5926 events. 4103/5926 cut-off events. For 2126/2126 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 28805 event pairs, 1102 based on Foata normal form. 16/5942 useless extension candidates. Maximal degree in co-relation 13950. Up to 2646 conditions per place. [2024-11-10 10:16:36,691 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 54 selfloop transitions, 2 changer transitions 65/126 dead transitions. [2024-11-10 10:16:36,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 126 transitions, 687 flow [2024-11-10 10:16:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:16:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:16:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-11-10 10:16:36,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-11-10 10:16:36,692 INFO L175 Difference]: Start difference. First operand has 74 places, 52 transitions, 199 flow. Second operand 8 states and 162 transitions. [2024-11-10 10:16:36,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 126 transitions, 687 flow [2024-11-10 10:16:36,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 126 transitions, 631 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-11-10 10:16:36,695 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 182 flow [2024-11-10 10:16:36,695 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2024-11-10 10:16:36,696 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2024-11-10 10:16:36,696 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 182 flow [2024-11-10 10:16:36,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-11-10 10:16:36,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:36,696 INFO L204 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, 1, 1, 1, 1] [2024-11-10 10:16:36,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:16:36,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:16:36,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2122600109, now seen corresponding path program 5 times [2024-11-10 10:16:36,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:36,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474776513] [2024-11-10 10:16:36,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:16:36,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:16:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:16:36,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:16:36,803 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:16:36,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-10 10:16:36,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-10 10:16:36,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-10 10:16:36,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 10:16:36,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 10:16:36,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 10:16:36,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-10 10:16:36,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:16:36,807 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:16:36,890 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:16:36,890 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:16:36,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:16:36 BasicIcfg [2024-11-10 10:16:36,898 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:16:36,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:16:36,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:16:36,899 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:16:36,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:15:54" (3/4) ... [2024-11-10 10:16:36,899 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:16:36,992 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:16:36,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:16:36,993 INFO L158 Benchmark]: Toolchain (without parser) took 43797.09ms. Allocated memory was 142.6MB in the beginning and 13.7GB in the end (delta: 13.5GB). Free memory was 72.9MB in the beginning and 11.1GB in the end (delta: -11.0GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-11-10 10:16:36,993 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 142.6MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:16:36,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 758.68ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 47.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 10:16:36,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.45ms. Allocated memory was 142.6MB in the beginning and 247.5MB in the end (delta: 104.9MB). Free memory was 46.6MB in the beginning and 217.0MB in the end (delta: -170.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-10 10:16:36,994 INFO L158 Benchmark]: Boogie Preprocessor took 71.83ms. Allocated memory is still 247.5MB. Free memory was 217.0MB in the beginning and 215.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-10 10:16:36,994 INFO L158 Benchmark]: IcfgBuilder took 604.06ms. Allocated memory is still 247.5MB. Free memory was 215.0MB in the beginning and 161.5MB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-10 10:16:36,994 INFO L158 Benchmark]: TraceAbstraction took 42178.17ms. Allocated memory was 247.5MB in the beginning and 13.7GB in the end (delta: 13.4GB). Free memory was 160.4MB in the beginning and 11.1GB in the end (delta: -10.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-10 10:16:36,994 INFO L158 Benchmark]: Witness Printer took 94.23ms. Allocated memory is still 13.7GB. Free memory was 11.1GB in the beginning and 11.1GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 10:16:36,995 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.52ms. Allocated memory is still 142.6MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 758.68ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 47.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.45ms. Allocated memory was 142.6MB in the beginning and 247.5MB in the end (delta: 104.9MB). Free memory was 46.6MB in the beginning and 217.0MB in the end (delta: -170.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.83ms. Allocated memory is still 247.5MB. Free memory was 217.0MB in the beginning and 215.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * IcfgBuilder took 604.06ms. Allocated memory is still 247.5MB. Free memory was 215.0MB in the beginning and 161.5MB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42178.17ms. Allocated memory was 247.5MB in the beginning and 13.7GB in the end (delta: 13.4GB). Free memory was 160.4MB in the beginning and 11.1GB in the end (delta: -10.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 94.23ms. Allocated memory is still 13.7GB. Free memory was 11.1GB in the beginning and 11.1GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1365=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1365=-2, t1366=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1365=-2, t1366=-1, t1367=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365=-2, t1366=-1, t1367=0, t1368=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365=-2, t1366=-1, t1367=0, t1368=1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365=-2, t1366=-1, t1367=0, t1368=1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365=-2, t1366=-1, t1367=0, t1368=1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: 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: 853]: 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: 847]: 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: 851]: 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: 849]: 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 9 procedures, 81 locations, 7 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: 42.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 38.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1146 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1143 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2794 IncrementalHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 1 mSDtfsCounter, 2794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=9, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 1530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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! [2024-11-10 10:16:37,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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