./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix031.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/pthread-wmm/mix031.opt.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix031.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 11:11:45,778 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 11:11:45,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 11:11:45,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 11:11:45,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 11:11:45,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 11:11:45,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 11:11:45,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 11:11:45,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 11:11:45,909 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 11:11:45,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 11:11:45,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 11:11:45,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 11:11:45,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 11:11:45,911 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 11:11:45,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 11:11:45,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 11:11:45,912 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 11:11:45,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 11:11:45,912 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 11:11:45,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 11:11:45,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 11:11:45,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 11:11:45,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 11:11:45,913 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 11:11:45,913 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 11:11:45,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 11:11:45,913 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 11:11:45,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 11:11:45,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 11:11:45,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 11:11:45,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 11:11:45,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:11:45,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 11:11:45,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 11:11:45,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 11:11:45,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 11:11:45,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 11:11:45,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 11:11:45,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 11:11:45,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 11:11:45,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 11:11:45,916 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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-jdk21/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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119
[2024-11-07 11:11:46,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 11:11:46,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 11:11:46,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 11:11:46,246 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 11:11:46,246 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 11:11:46,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix031.opt.i
[2024-11-07 11:11:47,544 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 11:11:47,834 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 11:11:47,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031.opt.i
[2024-11-07 11:11:47,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d859753e/d03b09e19ce948edb95f6bd7485e57a5/FLAG9fe018305
[2024-11-07 11:11:48,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d859753e/d03b09e19ce948edb95f6bd7485e57a5
[2024-11-07 11:11:48,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 11:11:48,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 11:11:48,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 11:11:48,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 11:11:48,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 11:11:48,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8cf1745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48, skipping insertion in model container
[2024-11-07 11:11:48,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,161 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 11:11:48,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031.opt.i[987,1000]
[2024-11-07 11:11:48,455 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:11:48,464 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 11:11:48,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031.opt.i[987,1000]
[2024-11-07 11:11:48,526 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 11:11:48,568 INFO L204 MainTranslator]: Completed translation
[2024-11-07 11:11:48,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48 WrapperNode
[2024-11-07 11:11:48,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 11:11:48,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 11:11:48,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 11:11:48,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 11:11:48,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,634 INFO L138 Inliner]: procedures = 174, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114
[2024-11-07 11:11:48,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 11:11:48,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 11:11:48,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 11:11:48,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 11:11:48,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,669 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-07 11:11:48,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 11:11:48,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 11:11:48,699 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 11:11:48,699 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 11:11:48,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (1/1) ...
[2024-11-07 11:11:48,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 11:11:48,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 11:11:48,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-07 11:11:48,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 11:11:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-07 11:11:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 11:11:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-07 11:11:48,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-07 11:11:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-07 11:11:48,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-07 11:11:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 11:11:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-07 11:11:48,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 11:11:48,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 11:11:48,762 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-07 11:11:48,918 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 11:11:48,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 11:11:49,234 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-07 11:11:49,234 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 11:11:49,434 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 11:11:49,434 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-07 11:11:49,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:11:49 BoogieIcfgContainer
[2024-11-07 11:11:49,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 11:11:49,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 11:11:49,437 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 11:11:49,441 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 11:11:49,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:11:48" (1/3) ...
[2024-11-07 11:11:49,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd726f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:11:49, skipping insertion in model container
[2024-11-07 11:11:49,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:11:48" (2/3) ...
[2024-11-07 11:11:49,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd726f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:11:49, skipping insertion in model container
[2024-11-07 11:11:49,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:11:49" (3/3) ...
[2024-11-07 11:11:49,444 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i
[2024-11-07 11:11:49,457 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 11:11:49,457 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-07 11:11:49,457 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-07 11:11:49,520 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-07 11:11:49,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 76 flow
[2024-11-07 11:11:49,624 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events.
[2024-11-07 11:11:49,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:11:49,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 1/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place.
[2024-11-07 11:11:49,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 34 transitions, 76 flow
[2024-11-07 11:11:49,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 70 flow
[2024-11-07 11:11:49,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 11:11:49,652 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;@39d6614d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 11:11:49,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-11-07 11:11:49,657 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-07 11:11:49,657 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events.
[2024-11-07 11:11:49,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:11:49,657 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:11:49,658 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 11:11:49,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:11:49,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:11:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash 865978659, now seen corresponding path program 1 times
[2024-11-07 11:11:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:11:49,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939737271]
[2024-11-07 11:11:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:11:49,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:11:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:11:50,122 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-07 11:11:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:11:50,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939737271]
[2024-11-07 11:11:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939737271] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:11:50,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:11:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 11:11:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433242307]
[2024-11-07 11:11:50,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:11:50,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 11:11:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:11:50,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 11:11:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 11:11:50,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 34
[2024-11-07 11:11:50,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-07 11:11:50,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:11:50,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 34
[2024-11-07 11:11:50,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:11:50,360 INFO L124 PetriNetUnfolderBase]: 95/270 cut-off events.
[2024-11-07 11:11:50,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-07 11:11:50,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 270 events. 95/270 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1488 event pairs, 14 based on Foata normal form. 12/274 useless extension candidates. Maximal degree in co-relation 446. Up to 136 conditions per place.
[2024-11-07 11:11:50,366 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 17 selfloop transitions, 2 changer transitions 2/37 dead transitions.
[2024-11-07 11:11:50,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 122 flow
[2024-11-07 11:11:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 11:11:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-07 11:11:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions.
[2024-11-07 11:11:50,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411
[2024-11-07 11:11:50,383 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 70 flow. Second operand 3 states and 78 transitions.
[2024-11-07 11:11:50,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 122 flow
[2024-11-07 11:11:50,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 11:11:50,391 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow
[2024-11-07 11:11:50,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29}
[2024-11-07 11:11:50,395 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places.
[2024-11-07 11:11:50,396 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow
[2024-11-07 11:11:50,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-07 11:11:50,396 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:11:50,396 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:11:50,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 11:11:50,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:11:50,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:11:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash 676662656, now seen corresponding path program 1 times
[2024-11-07 11:11:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:11:50,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992767500]
[2024-11-07 11:11:50,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:11:50,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:11:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:11:50,749 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-07 11:11:50,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:11:50,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992767500]
[2024-11-07 11:11:50,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992767500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:11:50,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:11:50,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:11:50,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580095691]
[2024-11-07 11:11:50,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:11:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:11:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:11:50,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:11:50,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:11:50,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34
[2024-11-07 11:11:50,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-07 11:11:50,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:11:50,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34
[2024-11-07 11:11:50,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:11:51,158 INFO L124 PetriNetUnfolderBase]: 363/703 cut-off events.
[2024-11-07 11:11:51,158 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-11-07 11:11:51,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 703 events. 363/703 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4024 event pairs, 124 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 1375. Up to 395 conditions per place.
[2024-11-07 11:11:51,164 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 23 selfloop transitions, 3 changer transitions 36/72 dead transitions.
[2024-11-07 11:11:51,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 290 flow
[2024-11-07 11:11:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 11:11:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-07 11:11:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-11-07 11:11:51,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471
[2024-11-07 11:11:51,167 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 8 states and 160 transitions.
[2024-11-07 11:11:51,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 290 flow
[2024-11-07 11:11:51,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-07 11:11:51,170 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 95 flow
[2024-11-07 11:11:51,171 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=95, PETRI_PLACES=46, PETRI_TRANSITIONS=30}
[2024-11-07 11:11:51,173 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places.
[2024-11-07 11:11:51,173 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 95 flow
[2024-11-07 11:11:51,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-07 11:11:51,173 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:11:51,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:11:51,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 11:11:51,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:11:51,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:11:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash 548031362, now seen corresponding path program 1 times
[2024-11-07 11:11:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:11:51,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403045300]
[2024-11-07 11:11:51,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:11:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:11:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:11:51,403 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-07 11:11:51,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:11:51,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403045300]
[2024-11-07 11:11:51,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403045300] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:11:51,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:11:51,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 11:11:51,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494640755]
[2024-11-07 11:11:51,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:11:51,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:11:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:11:51,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:11:51,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:11:51,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34
[2024-11-07 11:11:51,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 95 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-07 11:11:51,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:11:51,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34
[2024-11-07 11:11:51,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:11:51,659 INFO L124 PetriNetUnfolderBase]: 249/503 cut-off events.
[2024-11-07 11:11:51,659 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES.
[2024-11-07 11:11:51,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 503 events. 249/503 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2610 event pairs, 75 based on Foata normal form. 18/514 useless extension candidates. Maximal degree in co-relation 1233. Up to 281 conditions per place.
[2024-11-07 11:11:51,668 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 22 selfloop transitions, 3 changer transitions 21/56 dead transitions.
[2024-11-07 11:11:51,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 261 flow
[2024-11-07 11:11:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 11:11:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-07 11:11:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-11-07 11:11:51,671 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5504201680672269
[2024-11-07 11:11:51,671 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 95 flow. Second operand 7 states and 131 transitions.
[2024-11-07 11:11:51,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 261 flow
[2024-11-07 11:11:51,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 244 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-11-07 11:11:51,678 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 105 flow
[2024-11-07 11:11:51,679 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=105, PETRI_PLACES=48, PETRI_TRANSITIONS=30}
[2024-11-07 11:11:51,679 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places.
[2024-11-07 11:11:51,679 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 105 flow
[2024-11-07 11:11:51,680 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-07 11:11:51,680 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:11:51,680 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:11:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 11:11:51,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:11:51,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:11:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1928552721, now seen corresponding path program 1 times
[2024-11-07 11:11:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:11:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247704666]
[2024-11-07 11:11:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:11:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:11:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:11:52,172 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-07 11:11:52,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:11:52,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247704666]
[2024-11-07 11:11:52,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247704666] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:11:52,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:11:52,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 11:11:52,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048193665]
[2024-11-07 11:11:52,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:11:52,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 11:11:52,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:11:52,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 11:11:52,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-11-07 11:11:52,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34
[2024-11-07 11:11:52,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 105 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-07 11:11:52,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:11:52,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34
[2024-11-07 11:11:52,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:11:52,546 INFO L124 PetriNetUnfolderBase]: 233/477 cut-off events.
[2024-11-07 11:11:52,547 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES.
[2024-11-07 11:11:52,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 477 events. 233/477 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2362 event pairs, 110 based on Foata normal form. 18/489 useless extension candidates. Maximal degree in co-relation 1220. Up to 289 conditions per place.
[2024-11-07 11:11:52,551 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 33 selfloop transitions, 9 changer transitions 29/81 dead transitions.
[2024-11-07 11:11:52,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 416 flow
[2024-11-07 11:11:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-07 11:11:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-11-07 11:11:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions.
[2024-11-07 11:11:52,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454
[2024-11-07 11:11:52,553 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 105 flow. Second operand 11 states and 204 transitions.
[2024-11-07 11:11:52,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 416 flow
[2024-11-07 11:11:52,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 374 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-11-07 11:11:52,562 INFO L231 Difference]: Finished difference. Result has 57 places, 36 transitions, 163 flow
[2024-11-07 11:11:52,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=163, PETRI_PLACES=57, PETRI_TRANSITIONS=36}
[2024-11-07 11:11:52,565 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places.
[2024-11-07 11:11:52,567 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 163 flow
[2024-11-07 11:11:52,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-07 11:11:52,567 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:11:52,567 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]
[2024-11-07 11:11:52,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 11:11:52,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:11:52,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:11:52,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1498371259, now seen corresponding path program 1 times
[2024-11-07 11:11:52,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:11:52,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115975797]
[2024-11-07 11:11:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:11:52,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:11:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:11:52,768 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-07 11:11:52,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:11:52,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115975797]
[2024-11-07 11:11:52,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115975797] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:11:52,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:11:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 11:11:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212634497]
[2024-11-07 11:11:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:11:52,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 11:11:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:11:52,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 11:11:52,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 11:11:52,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34
[2024-11-07 11:11:52,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-07 11:11:52,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:11:52,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34
[2024-11-07 11:11:52,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:11:52,958 INFO L124 PetriNetUnfolderBase]: 155/348 cut-off events.
[2024-11-07 11:11:52,958 INFO L125 PetriNetUnfolderBase]: For 444/448 co-relation queries the response was YES.
[2024-11-07 11:11:52,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 348 events. 155/348 cut-off events. For 444/448 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1579 event pairs, 28 based on Foata normal form. 24/360 useless extension candidates. Maximal degree in co-relation 927. Up to 141 conditions per place.
[2024-11-07 11:11:52,961 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 30 selfloop transitions, 4 changer transitions 0/50 dead transitions.
[2024-11-07 11:11:52,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 268 flow
[2024-11-07 11:11:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 11:11:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-07 11:11:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions.
[2024-11-07 11:11:52,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353
[2024-11-07 11:11:52,963 INFO L175 Difference]: Start difference. First operand has 57 places, 36 transitions, 163 flow. Second operand 4 states and 94 transitions.
[2024-11-07 11:11:52,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 268 flow
[2024-11-07 11:11:52,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 245 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-11-07 11:11:52,969 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 157 flow
[2024-11-07 11:11:52,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=49, PETRI_TRANSITIONS=37}
[2024-11-07 11:11:52,969 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places.
[2024-11-07 11:11:52,969 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 157 flow
[2024-11-07 11:11:52,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-07 11:11:52,970 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:11:52,970 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]
[2024-11-07 11:11:52,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 11:11:52,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:11:52,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:11:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash -281557732, now seen corresponding path program 1 times
[2024-11-07 11:11:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:11:52,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977528236]
[2024-11-07 11:11:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:11:52,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:11:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:11:53,183 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-07 11:11:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:11:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977528236]
[2024-11-07 11:11:53,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977528236] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:11:53,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:11:53,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 11:11:53,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919321293]
[2024-11-07 11:11:53,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:11:53,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 11:11:53,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:11:53,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 11:11:53,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 11:11:53,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34
[2024-11-07 11:11:53,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-07 11:11:53,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:11:53,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34
[2024-11-07 11:11:53,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:11:53,322 INFO L124 PetriNetUnfolderBase]: 107/248 cut-off events.
[2024-11-07 11:11:53,322 INFO L125 PetriNetUnfolderBase]: For 217/219 co-relation queries the response was YES.
[2024-11-07 11:11:53,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 248 events. 107/248 cut-off events. For 217/219 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 975 event pairs, 28 based on Foata normal form. 16/252 useless extension candidates. Maximal degree in co-relation 682. Up to 98 conditions per place.
[2024-11-07 11:11:53,324 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 27 selfloop transitions, 6 changer transitions 0/49 dead transitions.
[2024-11-07 11:11:53,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 260 flow
[2024-11-07 11:11:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 11:11:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-07 11:11:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions.
[2024-11-07 11:11:53,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588
[2024-11-07 11:11:53,326 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 157 flow. Second operand 5 states and 108 transitions.
[2024-11-07 11:11:53,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 260 flow
[2024-11-07 11:11:53,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 230 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-11-07 11:11:53,329 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 161 flow
[2024-11-07 11:11:53,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=50, PETRI_TRANSITIONS=38}
[2024-11-07 11:11:53,331 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places.
[2024-11-07 11:11:53,331 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 161 flow
[2024-11-07 11:11:53,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-07 11:11:53,331 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:11:53,332 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-07 11:11:53,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 11:11:53,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:11:53,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:11:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1178590008, now seen corresponding path program 1 times
[2024-11-07 11:11:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:11:53,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424806887]
[2024-11-07 11:11:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:11:53,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:11:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 11:11:53,626 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-07 11:11:53,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 11:11:53,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424806887]
[2024-11-07 11:11:53,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424806887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 11:11:53,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 11:11:53,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 11:11:53,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909407724]
[2024-11-07 11:11:53,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 11:11:53,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 11:11:53,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 11:11:53,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 11:11:53,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 11:11:53,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 34
[2024-11-07 11:11:53,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-07 11:11:53,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-07 11:11:53,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 34
[2024-11-07 11:11:53,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-07 11:11:53,827 INFO L124 PetriNetUnfolderBase]: 138/382 cut-off events.
[2024-11-07 11:11:53,828 INFO L125 PetriNetUnfolderBase]: For 288/302 co-relation queries the response was YES.
[2024-11-07 11:11:53,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 382 events. 138/382 cut-off events. For 288/302 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1836 event pairs, 45 based on Foata normal form. 7/364 useless extension candidates. Maximal degree in co-relation 927. Up to 144 conditions per place.
[2024-11-07 11:11:53,833 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 20 selfloop transitions, 1 changer transitions 22/59 dead transitions.
[2024-11-07 11:11:53,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 305 flow
[2024-11-07 11:11:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 11:11:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-07 11:11:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions.
[2024-11-07 11:11:53,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921
[2024-11-07 11:11:53,835 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 161 flow. Second operand 6 states and 116 transitions.
[2024-11-07 11:11:53,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 305 flow
[2024-11-07 11:11:53,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 296 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-11-07 11:11:53,837 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 143 flow
[2024-11-07 11:11:53,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=57, PETRI_TRANSITIONS=34}
[2024-11-07 11:11:53,838 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places.
[2024-11-07 11:11:53,838 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 143 flow
[2024-11-07 11:11:53,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-07 11:11:53,838 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-07 11:11:53,838 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-07 11:11:53,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 11:11:53,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-11-07 11:11:53,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 11:11:53,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2052000374, now seen corresponding path program 2 times
[2024-11-07 11:11:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 11:11:53,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574800691]
[2024-11-07 11:11:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 11:11:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 11:11:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:11:53,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 11:11:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 11:11:53,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 11:11:53,979 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 11:11:53,980 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-11-07 11:11:53,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2024-11-07 11:11:53,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2024-11-07 11:11:53,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-11-07 11:11:53,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2024-11-07 11:11:53,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 11:11:53,982 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1]
[2024-11-07 11:11:54,040 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-07 11:11:54,041 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 11:11:54,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:11:54 BasicIcfg
[2024-11-07 11:11:54,045 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 11:11:54,046 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 11:11:54,046 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 11:11:54,046 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 11:11:54,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:11:49" (3/4) ...
[2024-11-07 11:11:54,048 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 11:11:54,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 11:11:54,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 11:11:54,121 INFO L158 Benchmark]: Toolchain (without parser) took 5997.50ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 75.5MB in the beginning and 100.1MB in the end (delta: -24.6MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB.
[2024-11-07 11:11:54,121 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:11:54,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.94ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 52.9MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 11:11:54,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.41ms. Allocated memory is still 100.7MB. Free memory was 52.9MB in the beginning and 50.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:11:54,122 INFO L158 Benchmark]: Boogie Preprocessor took 59.51ms. Allocated memory is still 100.7MB. Free memory was 50.8MB in the beginning and 48.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 11:11:54,122 INFO L158 Benchmark]: RCFGBuilder took 739.44ms. Allocated memory is still 100.7MB. Free memory was 48.1MB in the beginning and 45.0MB in the end (delta: 3.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB.
[2024-11-07 11:11:54,122 INFO L158 Benchmark]: TraceAbstraction took 4608.36ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 44.1MB in the beginning and 110.0MB in the end (delta: -65.9MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB.
[2024-11-07 11:11:54,123 INFO L158 Benchmark]: Witness Printer took 70.55ms. Allocated memory is still 151.0MB. Free memory was 110.0MB in the beginning and 100.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 11:11:54,124 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.43ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 449.94ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 52.9MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 63.41ms. Allocated memory is still 100.7MB. Free memory was 52.9MB in the beginning and 50.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 59.51ms. Allocated memory is still 100.7MB. Free memory was 50.8MB in the beginning and 48.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 739.44ms. Allocated memory is still 100.7MB. Free memory was 48.1MB in the beginning and 45.0MB in the end (delta: 3.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 4608.36ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 44.1MB in the beginning and 110.0MB in the end (delta: -65.9MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB.
* Witness Printer took 70.55ms. Allocated memory is still 151.0MB. Free memory was 110.0MB in the beginning and 100.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p0_EBX = 0;
[L715] 0 int __unbuffered_p1_EAX = 0;
[L717] 0 int __unbuffered_p1_EBX = 0;
[L719] 0 int a = 0;
[L720] 0 _Bool main$tmp_guard0;
[L721] 0 _Bool main$tmp_guard1;
[L723] 0 int x = 0;
[L725] 0 int y = 0;
[L726] 0 _Bool y$flush_delayed;
[L727] 0 int y$mem_tmp;
[L728] 0 _Bool y$r_buff0_thd0;
[L729] 0 _Bool y$r_buff0_thd1;
[L730] 0 _Bool y$r_buff0_thd2;
[L731] 0 _Bool y$r_buff1_thd0;
[L732] 0 _Bool y$r_buff1_thd1;
[L733] 0 _Bool y$r_buff1_thd2;
[L734] 0 _Bool y$read_delayed;
[L735] 0 int *y$read_delayed_var;
[L736] 0 int y$w_buff0;
[L737] 0 _Bool y$w_buff0_used;
[L738] 0 int y$w_buff1;
[L739] 0 _Bool y$w_buff1_used;
[L741] 0 int z = 0;
[L742] 0 _Bool weak$$choice0;
[L743] 0 _Bool weak$$choice2;
[L823] 0 pthread_t t835;
[L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t835=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L825] 0 pthread_t t836;
[L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t835=-2, t836=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L781] 2 y$w_buff1 = y$w_buff0
[L782] 2 y$w_buff0 = 1
[L783] 2 y$w_buff1_used = y$w_buff0_used
[L784] 2 y$w_buff0_used = (_Bool)1
[L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0
[L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1
[L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2
[L789] 2 y$r_buff0_thd2 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L792] 2 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L795] 2 __unbuffered_p1_EAX = z
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L798] 2 __unbuffered_p1_EBX = a
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L747] 1 a = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L750] 1 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L753] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L756] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L757] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L758] 1 y$flush_delayed = weak$$choice2
[L759] 1 y$mem_tmp = y
[L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L767] 1 __unbuffered_p0_EBX = y
[L768] 1 y = y$flush_delayed ? y$mem_tmp : y
[L769] 1 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835=-2, t836=-1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L830] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L830] RET 0 assume_abort_if_not(main$tmp_guard0)
[L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835=-2, t836=-1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835=-2, t836=-1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L841] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L19] 0 reach_error()
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
- UnprovableResult [Line: 19]: 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: 826]: 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: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 55 locations, 5 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: 4.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 575 IncrementalHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 27 mSDtfsCounter, 575 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-07 11:11:54,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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