./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdecd751bbf3d5ef761eacebee2616261a6cad4ae3645147e0ad096bd1775198 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:57:52,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:57:52,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:57:52,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:57:52,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:57:52,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:57:52,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:57:52,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:57:52,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:57:52,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:57:52,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:57:52,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:57:52,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:57:52,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:57:52,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:57:52,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:57:52,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:57:52,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:57:52,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:57:52,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:57:52,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:57:52,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:57:52,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:57:52,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:57:52,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:57:52,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:57:52,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:57:52,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:57:52,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:57:52,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:57:52,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:57:52,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:57:52,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:57:52,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:57:52,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:57:52,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:57:52,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:57:52,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:57:52,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:57:52,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:57:52,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:57:52,877 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:57:52,893 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:57:52,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:57:52,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:57:52,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:57:52,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:57:52,896 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:57:52,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:57:52,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:57:52,897 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:57:52,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:57:52,897 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:57:52,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:57:52,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:57:52,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:57:52,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:57:52,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:57:52,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:57:52,899 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:57:52,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:57:52,899 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:57:52,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:57:52,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:57:52,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:57:52,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:57:52,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:57:52,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:57:52,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:57:52,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:57:52,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:57:52,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:57:52,901 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:57:52,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:57:52,902 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:57:52,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:57:52,902 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:57:52,902 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdecd751bbf3d5ef761eacebee2616261a6cad4ae3645147e0ad096bd1775198 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:57:53,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:57:53,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:57:53,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:57:53,216 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:57:53,216 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:57:53,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-09-01 09:57:54,394 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:57:54,617 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:57:54,618 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-09-01 09:57:54,631 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6512a124c/8155cfc16d424a9ab18408feb4c34f87/FLAGa3dc89316 [2023-09-01 09:57:54,641 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6512a124c/8155cfc16d424a9ab18408feb4c34f87 [2023-09-01 09:57:54,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:57:54,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:57:54,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:57:54,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:57:54,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:57:54,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:57:54" (1/1) ... [2023-09-01 09:57:54,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21588703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:54, skipping insertion in model container [2023-09-01 09:57:54,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:57:54" (1/1) ... [2023-09-01 09:57:54,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:57:54,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:57:54,825 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-09-01 09:57:54,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:57:55,007 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:57:55,016 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-09-01 09:57:55,073 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:57:55,111 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:57:55,111 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:57:55,116 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:57:55,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55 WrapperNode [2023-09-01 09:57:55,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:57:55,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:57:55,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:57:55,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:57:55,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,175 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2023-09-01 09:57:55,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:57:55,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:57:55,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:57:55,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:57:55,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,211 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:57:55,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:57:55,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:57:55,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:57:55,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (1/1) ... [2023-09-01 09:57:55,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:57:55,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:57:55,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:57:55,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:57:55,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:57:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:57:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:57:55,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:57:55,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:57:55,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:57:55,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:57:55,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:57:55,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:57:55,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:57:55,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:57:55,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:57:55,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:57:55,322 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:57:55,505 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:57:55,507 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:57:55,735 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:57:55,860 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:57:55,860 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:57:55,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:55 BoogieIcfgContainer [2023-09-01 09:57:55,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:57:55,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:57:55,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:57:55,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:57:55,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:57:54" (1/3) ... [2023-09-01 09:57:55,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e737bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:57:55, skipping insertion in model container [2023-09-01 09:57:55,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:55" (2/3) ... [2023-09-01 09:57:55,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e737bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:57:55, skipping insertion in model container [2023-09-01 09:57:55,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:55" (3/3) ... [2023-09-01 09:57:55,869 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-09-01 09:57:55,875 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:57:55,882 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:57:55,883 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:57:55,883 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:57:55,920 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:57:55,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 186 flow [2023-09-01 09:57:55,983 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2023-09-01 09:57:55,983 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:55,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-09-01 09:57:55,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 88 transitions, 186 flow [2023-09-01 09:57:55,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 86 transitions, 178 flow [2023-09-01 09:57:55,993 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:57:56,003 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 86 transitions, 178 flow [2023-09-01 09:57:56,005 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 86 transitions, 178 flow [2023-09-01 09:57:56,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 178 flow [2023-09-01 09:57:56,025 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2023-09-01 09:57:56,025 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:56,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-09-01 09:57:56,027 INFO L119 LiptonReduction]: Number of co-enabled transitions 1034 [2023-09-01 09:57:58,652 INFO L134 LiptonReduction]: Checked pairs total: 2705 [2023-09-01 09:57:58,653 INFO L136 LiptonReduction]: Total number of compositions: 81 [2023-09-01 09:57:58,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:57:58,684 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13236d6f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:57:58,685 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 09:57:58,687 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-09-01 09:57:58,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:58,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:58,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 09:57:58,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:58,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash 401560, now seen corresponding path program 1 times [2023-09-01 09:57:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:58,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493302878] [2023-09-01 09:57:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:59,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:59,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493302878] [2023-09-01 09:57:59,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493302878] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:59,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:59,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:57:59,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402628134] [2023-09-01 09:57:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:59,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:57:59,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:59,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:57:59,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:57:59,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 169 [2023-09-01 09:57:59,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:59,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 169 [2023-09-01 09:57:59,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:59,323 INFO L130 PetriNetUnfolder]: 142/278 cut-off events. [2023-09-01 09:57:59,327 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 09:57:59,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 278 events. 142/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1172 event pairs, 16 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 533. Up to 208 conditions per place. [2023-09-01 09:57:59,330 INFO L137 encePairwiseOnDemand]: 165/169 looper letters, 21 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-09-01 09:57:59,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 111 flow [2023-09-01 09:57:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:57:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:57:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-09-01 09:57:59,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504930966469428 [2023-09-01 09:57:59,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-09-01 09:57:59,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-09-01 09:57:59,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:59,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-09-01 09:57:59,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,354 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 42 flow. Second operand 3 states and 256 transitions. [2023-09-01 09:57:59,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 111 flow [2023-09-01 09:57:59,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:57:59,358 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-09-01 09:57:59,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-09-01 09:57:59,362 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-09-01 09:57:59,362 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-09-01 09:57:59,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:59,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:59,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:57:59,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:59,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1521572652, now seen corresponding path program 1 times [2023-09-01 09:57:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:59,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587203429] [2023-09-01 09:57:59,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:59,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:59,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587203429] [2023-09-01 09:57:59,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587203429] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:59,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:59,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:57:59,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709080362] [2023-09-01 09:57:59,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:59,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:57:59,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:59,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:57:59,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:57:59,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 169 [2023-09-01 09:57:59,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:59,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 169 [2023-09-01 09:57:59,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:59,642 INFO L130 PetriNetUnfolder]: 104/190 cut-off events. [2023-09-01 09:57:59,643 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-09-01 09:57:59,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 190 events. 104/190 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 654 event pairs, 24 based on Foata normal form. 4/193 useless extension candidates. Maximal degree in co-relation 404. Up to 157 conditions per place. [2023-09-01 09:57:59,646 INFO L137 encePairwiseOnDemand]: 166/169 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-09-01 09:57:59,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 88 flow [2023-09-01 09:57:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:57:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:57:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-09-01 09:57:59,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47731755424063116 [2023-09-01 09:57:59,653 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-09-01 09:57:59,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-09-01 09:57:59,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:59,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-09-01 09:57:59,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,659 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 242 transitions. [2023-09-01 09:57:59,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 88 flow [2023-09-01 09:57:59,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:57:59,660 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2023-09-01 09:57:59,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-09-01 09:57:59,661 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-09-01 09:57:59,661 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2023-09-01 09:57:59,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:59,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:59,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:57:59,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:59,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:59,663 INFO L85 PathProgramCache]: Analyzing trace with hash -75889412, now seen corresponding path program 1 times [2023-09-01 09:57:59,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:59,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595296359] [2023-09-01 09:57:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:59,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595296359] [2023-09-01 09:57:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595296359] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:59,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:59,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:57:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520613820] [2023-09-01 09:57:59,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:59,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:57:59,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:59,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:57:59,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:57:59,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 169 [2023-09-01 09:57:59,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:59,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 169 [2023-09-01 09:57:59,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:59,969 INFO L130 PetriNetUnfolder]: 160/294 cut-off events. [2023-09-01 09:57:59,969 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2023-09-01 09:57:59,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 294 events. 160/294 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1122 event pairs, 41 based on Foata normal form. 20/314 useless extension candidates. Maximal degree in co-relation 636. Up to 114 conditions per place. [2023-09-01 09:57:59,972 INFO L137 encePairwiseOnDemand]: 165/169 looper letters, 20 selfloop transitions, 3 changer transitions 7/30 dead transitions. [2023-09-01 09:57:59,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 30 transitions, 137 flow [2023-09-01 09:57:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:57:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:57:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 324 transitions. [2023-09-01 09:57:59,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47928994082840237 [2023-09-01 09:57:59,975 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 324 transitions. [2023-09-01 09:57:59,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 324 transitions. [2023-09-01 09:57:59,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:59,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 324 transitions. [2023-09-01 09:57:59,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,979 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,979 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 324 transitions. [2023-09-01 09:57:59,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 30 transitions, 137 flow [2023-09-01 09:57:59,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 30 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:57:59,981 INFO L231 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2023-09-01 09:57:59,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2023-09-01 09:57:59,982 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2023-09-01 09:57:59,985 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 15 transitions, 52 flow [2023-09-01 09:57:59,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:59,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:59,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:59,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:57:59,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:59,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:59,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1163643068, now seen corresponding path program 1 times [2023-09-01 09:57:59,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228086072] [2023-09-01 09:57:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:58:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:58:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:58:00,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:58:00,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228086072] [2023-09-01 09:58:00,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228086072] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:58:00,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:58:00,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:58:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635862739] [2023-09-01 09:58:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:58:00,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:58:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:58:00,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:58:00,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:58:00,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-09-01 09:58:00,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 15 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:00,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:58:00,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-09-01 09:58:00,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:58:00,293 INFO L130 PetriNetUnfolder]: 47/109 cut-off events. [2023-09-01 09:58:00,293 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-09-01 09:58:00,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 109 events. 47/109 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 319 event pairs, 18 based on Foata normal form. 16/124 useless extension candidates. Maximal degree in co-relation 265. Up to 43 conditions per place. [2023-09-01 09:58:00,294 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 24 selfloop transitions, 4 changer transitions 1/30 dead transitions. [2023-09-01 09:58:00,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 30 transitions, 150 flow [2023-09-01 09:58:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:58:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:58:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2023-09-01 09:58:00,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4718934911242604 [2023-09-01 09:58:00,296 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 319 transitions. [2023-09-01 09:58:00,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 319 transitions. [2023-09-01 09:58:00,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:58:00,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 319 transitions. [2023-09-01 09:58:00,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:00,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:00,300 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:00,300 INFO L175 Difference]: Start difference. First operand has 26 places, 15 transitions, 52 flow. Second operand 4 states and 319 transitions. [2023-09-01 09:58:00,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 30 transitions, 150 flow [2023-09-01 09:58:00,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 30 transitions, 134 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:58:00,301 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 66 flow [2023-09-01 09:58:00,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2023-09-01 09:58:00,302 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2023-09-01 09:58:00,302 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 66 flow [2023-09-01 09:58:00,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:00,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:58:00,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:58:00,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:58:00,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:58:00,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:58:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1853160667, now seen corresponding path program 1 times [2023-09-01 09:58:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:58:00,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832863612] [2023-09-01 09:58:00,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:58:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:58:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:58:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:58:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:58:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832863612] [2023-09-01 09:58:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832863612] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:58:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:58:00,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:58:00,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893923875] [2023-09-01 09:58:00,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:58:00,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:58:00,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:58:00,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:58:00,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:58:00,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-09-01 09:58:00,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:00,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:58:00,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-09-01 09:58:00,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:58:00,611 INFO L130 PetriNetUnfolder]: 19/55 cut-off events. [2023-09-01 09:58:00,612 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-09-01 09:58:00,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 55 events. 19/55 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 113 event pairs, 7 based on Foata normal form. 7/61 useless extension candidates. Maximal degree in co-relation 155. Up to 24 conditions per place. [2023-09-01 09:58:00,612 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 16 selfloop transitions, 6 changer transitions 1/24 dead transitions. [2023-09-01 09:58:00,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 133 flow [2023-09-01 09:58:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:58:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:58:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2023-09-01 09:58:00,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4556213017751479 [2023-09-01 09:58:00,615 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 385 transitions. [2023-09-01 09:58:00,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 385 transitions. [2023-09-01 09:58:00,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:58:00,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 385 transitions. [2023-09-01 09:58:00,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:00,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:00,619 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:00,619 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 66 flow. Second operand 5 states and 385 transitions. [2023-09-01 09:58:00,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 133 flow [2023-09-01 09:58:00,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 119 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-09-01 09:58:00,621 INFO L231 Difference]: Finished difference. Result has 30 places, 17 transitions, 78 flow [2023-09-01 09:58:00,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2023-09-01 09:58:00,622 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2023-09-01 09:58:00,622 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 78 flow [2023-09-01 09:58:00,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:00,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:58:00,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:58:00,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:58:00,623 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:58:00,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:58:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash 107770662, now seen corresponding path program 1 times [2023-09-01 09:58:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:58:00,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548065230] [2023-09-01 09:58:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:58:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:58:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:58:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:58:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:58:01,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548065230] [2023-09-01 09:58:01,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548065230] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:58:01,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:58:01,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:58:01,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284815170] [2023-09-01 09:58:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:58:01,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:58:01,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:58:01,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:58:01,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:58:01,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 169 [2023-09-01 09:58:01,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:01,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:58:01,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 169 [2023-09-01 09:58:01,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:58:01,480 INFO L130 PetriNetUnfolder]: 15/54 cut-off events. [2023-09-01 09:58:01,481 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-09-01 09:58:01,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 54 events. 15/54 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 3 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 167. Up to 18 conditions per place. [2023-09-01 09:58:01,481 INFO L137 encePairwiseOnDemand]: 163/169 looper letters, 15 selfloop transitions, 3 changer transitions 14/33 dead transitions. [2023-09-01 09:58:01,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 225 flow [2023-09-01 09:58:01,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:58:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:58:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 526 transitions. [2023-09-01 09:58:01,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4446322907861369 [2023-09-01 09:58:01,484 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 526 transitions. [2023-09-01 09:58:01,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 526 transitions. [2023-09-01 09:58:01,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:58:01,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 526 transitions. [2023-09-01 09:58:01,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 75.14285714285714) internal successors, (526), 7 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:01,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:01,489 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:01,489 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 78 flow. Second operand 7 states and 526 transitions. [2023-09-01 09:58:01,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 225 flow [2023-09-01 09:58:01,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 159 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-09-01 09:58:01,492 INFO L231 Difference]: Finished difference. Result has 32 places, 17 transitions, 62 flow [2023-09-01 09:58:01,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=62, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2023-09-01 09:58:01,495 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2023-09-01 09:58:01,495 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 62 flow [2023-09-01 09:58:01,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:58:01,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:58:01,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:58:01,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:58:01,498 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:58:01,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:58:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash 627768786, now seen corresponding path program 2 times [2023-09-01 09:58:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:58:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046571848] [2023-09-01 09:58:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:58:01,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:58:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:58:01,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:58:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:58:01,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:58:01,614 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:58:01,615 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-01 09:58:01,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-09-01 09:58:01,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-01 09:58:01,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-09-01 09:58:01,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-09-01 09:58:01,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:58:01,618 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-09-01 09:58:01,623 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:58:01,623 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:58:01,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:58:01 BasicIcfg [2023-09-01 09:58:01,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:58:01,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:58:01,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:58:01,688 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:58:01,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:55" (3/4) ... [2023-09-01 09:58:01,690 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:58:01,764 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:58:01,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:58:01,765 INFO L158 Benchmark]: Toolchain (without parser) took 7120.22ms. Allocated memory was 92.3MB in the beginning and 174.1MB in the end (delta: 81.8MB). Free memory was 69.3MB in the beginning and 95.9MB in the end (delta: -26.6MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2023-09-01 09:58:01,765 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:58:01,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.51ms. Allocated memory is still 92.3MB. Free memory was 69.0MB in the beginning and 68.5MB in the end (delta: 546.6kB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2023-09-01 09:58:01,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.66ms. Allocated memory is still 92.3MB. Free memory was 68.5MB in the beginning and 66.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:58:01,766 INFO L158 Benchmark]: Boogie Preprocessor took 38.66ms. Allocated memory is still 92.3MB. Free memory was 66.4MB in the beginning and 64.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:58:01,766 INFO L158 Benchmark]: RCFGBuilder took 647.24ms. Allocated memory is still 92.3MB. Free memory was 64.3MB in the beginning and 65.3MB in the end (delta: -1.0MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2023-09-01 09:58:01,766 INFO L158 Benchmark]: TraceAbstraction took 5823.33ms. Allocated memory was 92.3MB in the beginning and 174.1MB in the end (delta: 81.8MB). Free memory was 64.8MB in the beginning and 102.2MB in the end (delta: -37.4MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2023-09-01 09:58:01,767 INFO L158 Benchmark]: Witness Printer took 76.70ms. Allocated memory is still 174.1MB. Free memory was 102.2MB in the beginning and 95.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-09-01 09:58:01,768 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.51ms. Allocated memory is still 92.3MB. Free memory was 69.0MB in the beginning and 68.5MB in the end (delta: 546.6kB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.66ms. Allocated memory is still 92.3MB. Free memory was 68.5MB in the beginning and 66.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.66ms. Allocated memory is still 92.3MB. Free memory was 66.4MB in the beginning and 64.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 647.24ms. Allocated memory is still 92.3MB. Free memory was 64.3MB in the beginning and 65.3MB in the end (delta: -1.0MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5823.33ms. Allocated memory was 92.3MB in the beginning and 174.1MB in the end (delta: 81.8MB). Free memory was 64.8MB in the beginning and 102.2MB in the end (delta: -37.4MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * Witness Printer took 76.70ms. Allocated memory is still 174.1MB. Free memory was 102.2MB in the beginning and 95.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 91 PlacesBefore, 24 PlacesAfterwards, 86 TransitionsBefore, 18 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 2705 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1129, independent: 995, independent conditional: 0, independent unconditional: 995, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 587, independent: 560, independent conditional: 0, independent unconditional: 560, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1129, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 587, unknown conditional: 0, unknown unconditional: 587] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2305; [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2305, ((void *)0), P0, ((void *)0))=-2, t2305={5: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=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] [L809] 0 pthread_t t2306; [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2306, ((void *)0), P1, ((void *)0))=-1, t2305={5:0}, t2306={3: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=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] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L785] 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) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 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 [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 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) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 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 [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L825] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 106 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: 5.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 311 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 38 mSDtfsCounter, 311 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=5, InterpolantAutomatonStates: 26, 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.6s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:58:01,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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