/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:38:16,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:38:16,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:38:16,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:38:16,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:38:16,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:38:16,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:38:16,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:38:16,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:38:16,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:38:16,845 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:38:16,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:38:16,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:38:16,847 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:38:16,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:38:16,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:38:16,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:38:16,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:38:16,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:38:16,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:38:16,848 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:38:16,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:38:16,849 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:38:16,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:38:16,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:38:16,850 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:38:16,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:38:16,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:38:16,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:38:16,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:38:16,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:38:16,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:38:16,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:38:16,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:38:16,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:38:16,853 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:38:17,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:38:17,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:38:17,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:38:17,177 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:38:17,180 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:38:17,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2023-08-24 05:38:18,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:38:18,833 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:38:18,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2023-08-24 05:38:18,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1224a00/ff7770682e5e478d94734857644fffb1/FLAG1f1308c7e [2023-08-24 05:38:18,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1224a00/ff7770682e5e478d94734857644fffb1 [2023-08-24 05:38:18,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:38:18,868 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:38:18,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:38:18,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:38:18,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:38:18,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:38:18" (1/1) ... [2023-08-24 05:38:18,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce8fd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:18, skipping insertion in model container [2023-08-24 05:38:18,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:38:18" (1/1) ... [2023-08-24 05:38:18,928 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:38:19,058 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-24 05:38:19,604 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015] [2023-08-24 05:38:19,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:38:19,651 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:38:19,662 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-24 05:38:19,666 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [251] [2023-08-24 05:38:19,668 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [251] [2023-08-24 05:38:19,674 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [735] [2023-08-24 05:38:19,691 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015] [2023-08-24 05:38:19,693 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned long [1691] [2023-08-24 05:38:19,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:38:19,805 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:38:19,805 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:38:19,806 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:38:19,812 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:38:19,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19 WrapperNode [2023-08-24 05:38:19,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:38:19,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:38:19,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:38:19,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:38:19,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,874 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 146 [2023-08-24 05:38:19,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:38:19,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:38:19,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:38:19,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:38:19,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:38:19,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:38:19,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:38:19,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:38:19,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (1/1) ... [2023-08-24 05:38:19,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:38:19,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:38:19,956 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-08-24 05:38:19,964 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-08-24 05:38:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:38:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:38:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:38:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 05:38:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-24 05:38:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:38:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-24 05:38:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:38:19,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:38:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-08-24 05:38:19,988 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-08-24 05:38:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:38:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:38:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:38:19,989 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:38:20,210 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:38:20,211 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:38:20,436 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:38:20,475 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:38:20,476 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:38:20,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:38:20 BoogieIcfgContainer [2023-08-24 05:38:20,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:38:20,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:38:20,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:38:20,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:38:20,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:38:18" (1/3) ... [2023-08-24 05:38:20,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f4c3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:38:20, skipping insertion in model container [2023-08-24 05:38:20,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:19" (2/3) ... [2023-08-24 05:38:20,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f4c3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:38:20, skipping insertion in model container [2023-08-24 05:38:20,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:38:20" (3/3) ... [2023-08-24 05:38:20,485 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2023-08-24 05:38:20,499 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:38:20,500 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-24 05:38:20,500 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:38:20,574 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 05:38:20,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 163 transitions, 342 flow [2023-08-24 05:38:20,710 INFO L124 PetriNetUnfolderBase]: 8/203 cut-off events. [2023-08-24 05:38:20,710 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 05:38:20,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 203 events. 8/203 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2023-08-24 05:38:20,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 163 transitions, 342 flow [2023-08-24 05:38:20,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 149 transitions, 310 flow [2023-08-24 05:38:20,731 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:38:20,748 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 149 transitions, 310 flow [2023-08-24 05:38:20,750 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 149 transitions, 310 flow [2023-08-24 05:38:20,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 149 transitions, 310 flow [2023-08-24 05:38:20,799 INFO L124 PetriNetUnfolderBase]: 5/180 cut-off events. [2023-08-24 05:38:20,799 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 05:38:20,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 180 events. 5/180 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 304 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2023-08-24 05:38:20,804 INFO L119 LiptonReduction]: Number of co-enabled transitions 2772 [2023-08-24 05:38:30,964 INFO L134 LiptonReduction]: Checked pairs total: 6373 [2023-08-24 05:38:30,964 INFO L136 LiptonReduction]: Total number of compositions: 145 [2023-08-24 05:38:30,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:38:30,988 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=false, 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;@2fb9081b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:38:30,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-08-24 05:38:30,992 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:38:30,992 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-24 05:38:30,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:38:30,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:30,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 05:38:30,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:31,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:31,001 INFO L85 PathProgramCache]: Analyzing trace with hash 569233885, now seen corresponding path program 1 times [2023-08-24 05:38:31,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:31,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922361230] [2023-08-24 05:38:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:38:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:38:31,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:38:31,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922361230] [2023-08-24 05:38:31,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922361230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:38:31,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:38:31,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:38:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339739682] [2023-08-24 05:38:31,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:38:31,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:38:31,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:38:31,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:38:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:38:31,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 308 [2023-08-24 05:38:31,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-08-24 05:38:31,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:38:31,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 308 [2023-08-24 05:38:31,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:38:31,822 INFO L124 PetriNetUnfolderBase]: 617/1073 cut-off events. [2023-08-24 05:38:31,822 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-24 05:38:31,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 1073 events. 617/1073 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4898 event pairs, 372 based on Foata normal form. 37/989 useless extension candidates. Maximal degree in co-relation 1936. Up to 854 conditions per place. [2023-08-24 05:38:31,834 INFO L140 encePairwiseOnDemand]: 300/308 looper letters, 41 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2023-08-24 05:38:31,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 200 flow [2023-08-24 05:38:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:38:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:38:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-24 05:38:31,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2023-08-24 05:38:31,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-24 05:38:31,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-24 05:38:31,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:38:31,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-24 05:38:31,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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-08-24 05:38:31,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-24 05:38:31,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-24 05:38:31,873 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 84 flow. Second operand 3 states and 392 transitions. [2023-08-24 05:38:31,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 200 flow [2023-08-24 05:38:31,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:38:31,879 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 110 flow [2023-08-24 05:38:31,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2023-08-24 05:38:31,884 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-24 05:38:31,884 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 110 flow [2023-08-24 05:38:31,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-08-24 05:38:31,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:31,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-24 05:38:31,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:38:31,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:31,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:31,886 INFO L85 PathProgramCache]: Analyzing trace with hash 18362398, now seen corresponding path program 1 times [2023-08-24 05:38:31,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:31,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613806364] [2023-08-24 05:38:31,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:31,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:38:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:38:32,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:38:32,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613806364] [2023-08-24 05:38:32,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613806364] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:38:32,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:38:32,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:38:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61835038] [2023-08-24 05:38:32,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:38:32,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:38:32,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:38:32,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:38:32,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:38:32,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 308 [2023-08-24 05:38:32,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-08-24 05:38:32,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:38:32,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 308 [2023-08-24 05:38:32,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:38:32,423 INFO L124 PetriNetUnfolderBase]: 733/1280 cut-off events. [2023-08-24 05:38:32,423 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2023-08-24 05:38:32,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 1280 events. 733/1280 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6211 event pairs, 448 based on Foata normal form. 0/1165 useless extension candidates. Maximal degree in co-relation 1203. Up to 1061 conditions per place. [2023-08-24 05:38:32,431 INFO L140 encePairwiseOnDemand]: 301/308 looper letters, 44 selfloop transitions, 9 changer transitions 2/55 dead transitions. [2023-08-24 05:38:32,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 275 flow [2023-08-24 05:38:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:38:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:38:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-08-24 05:38:32,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2023-08-24 05:38:32,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-08-24 05:38:32,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-08-24 05:38:32,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:38:32,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-08-24 05:38:32,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-08-24 05:38:32,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-24 05:38:32,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-24 05:38:32,438 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 110 flow. Second operand 3 states and 390 transitions. [2023-08-24 05:38:32,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 275 flow [2023-08-24 05:38:32,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:38:32,445 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 175 flow [2023-08-24 05:38:32,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2023-08-24 05:38:32,446 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-24 05:38:32,446 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 175 flow [2023-08-24 05:38:32,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-08-24 05:38:32,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:32,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:38:32,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:38:32,447 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:32,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1101182937, now seen corresponding path program 1 times [2023-08-24 05:38:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113585467] [2023-08-24 05:38:32,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:38:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:38:32,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:38:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113585467] [2023-08-24 05:38:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113585467] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:38:32,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:38:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:38:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282202462] [2023-08-24 05:38:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:38:32,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:38:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:38:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:38:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:38:32,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 308 [2023-08-24 05:38:32,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 45 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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-08-24 05:38:32,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:38:32,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 308 [2023-08-24 05:38:32,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:38:32,617 INFO L124 PetriNetUnfolderBase]: 154/314 cut-off events. [2023-08-24 05:38:32,618 INFO L125 PetriNetUnfolderBase]: For 187/207 co-relation queries the response was YES. [2023-08-24 05:38:32,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 314 events. 154/314 cut-off events. For 187/207 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1195 event pairs, 100 based on Foata normal form. 50/348 useless extension candidates. Maximal degree in co-relation 735. Up to 207 conditions per place. [2023-08-24 05:38:32,620 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 30 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-08-24 05:38:32,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 164 flow [2023-08-24 05:38:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:38:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:38:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-08-24 05:38:32,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4902597402597403 [2023-08-24 05:38:32,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-08-24 05:38:32,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-08-24 05:38:32,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:38:32,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-08-24 05:38:32,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 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-08-24 05:38:32,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-24 05:38:32,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-24 05:38:32,625 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 175 flow. Second operand 3 states and 453 transitions. [2023-08-24 05:38:32,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 164 flow [2023-08-24 05:38:32,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 152 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 05:38:32,627 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 72 flow [2023-08-24 05:38:32,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-08-24 05:38:32,628 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2023-08-24 05:38:32,628 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 72 flow [2023-08-24 05:38:32,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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-08-24 05:38:32,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:32,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:38:32,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:38:32,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:32,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash -307232839, now seen corresponding path program 1 times [2023-08-24 05:38:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:32,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329880987] [2023-08-24 05:38:32,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:38:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:38:32,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:38:32,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329880987] [2023-08-24 05:38:32,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329880987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:38:32,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:38:32,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:38:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547034149] [2023-08-24 05:38:32,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:38:32,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:38:32,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:38:32,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:38:32,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:38:32,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 308 [2023-08-24 05:38:32,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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-08-24 05:38:32,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:38:32,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 308 [2023-08-24 05:38:32,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:38:32,964 INFO L124 PetriNetUnfolderBase]: 214/415 cut-off events. [2023-08-24 05:38:32,965 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-08-24 05:38:32,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 415 events. 214/415 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1413 event pairs, 167 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 1008. Up to 357 conditions per place. [2023-08-24 05:38:32,968 INFO L140 encePairwiseOnDemand]: 301/308 looper letters, 35 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2023-08-24 05:38:32,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 185 flow [2023-08-24 05:38:32,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:38:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:38:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-24 05:38:32,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2023-08-24 05:38:32,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-24 05:38:32,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-24 05:38:32,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:38:32,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-24 05:38:32,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-08-24 05:38:32,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-24 05:38:32,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-24 05:38:32,974 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 72 flow. Second operand 3 states and 399 transitions. [2023-08-24 05:38:32,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 185 flow [2023-08-24 05:38:32,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:38:32,976 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 118 flow [2023-08-24 05:38:32,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2023-08-24 05:38:32,977 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-24 05:38:32,978 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 118 flow [2023-08-24 05:38:32,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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-08-24 05:38:32,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:32,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:38:32,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:38:32,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:32,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:32,979 INFO L85 PathProgramCache]: Analyzing trace with hash -839755071, now seen corresponding path program 1 times [2023-08-24 05:38:32,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:32,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750609001] [2023-08-24 05:38:32,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:32,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:38:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:38:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:38:33,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750609001] [2023-08-24 05:38:33,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750609001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:38:33,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:38:33,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:38:33,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726563910] [2023-08-24 05:38:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:38:33,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:38:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:38:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:38:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:38:33,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 308 [2023-08-24 05:38:33,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-08-24 05:38:33,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:38:33,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 308 [2023-08-24 05:38:33,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:38:33,320 INFO L124 PetriNetUnfolderBase]: 225/445 cut-off events. [2023-08-24 05:38:33,320 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-08-24 05:38:33,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 445 events. 225/445 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1571 event pairs, 176 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 1125. Up to 376 conditions per place. [2023-08-24 05:38:33,322 INFO L140 encePairwiseOnDemand]: 301/308 looper letters, 37 selfloop transitions, 9 changer transitions 0/46 dead transitions. [2023-08-24 05:38:33,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 263 flow [2023-08-24 05:38:33,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:38:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:38:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-24 05:38:33,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43073593073593075 [2023-08-24 05:38:33,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-24 05:38:33,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-24 05:38:33,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:38:33,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-24 05:38:33,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-08-24 05:38:33,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-24 05:38:33,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-24 05:38:33,328 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 118 flow. Second operand 3 states and 398 transitions. [2023-08-24 05:38:33,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 263 flow [2023-08-24 05:38:33,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 237 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 05:38:33,333 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 176 flow [2023-08-24 05:38:33,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2023-08-24 05:38:33,335 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-24 05:38:33,335 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 176 flow [2023-08-24 05:38:33,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-08-24 05:38:33,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:38:33,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:38:33,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:38:33,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-24 05:38:33,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:38:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash -659219863, now seen corresponding path program 1 times [2023-08-24 05:38:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:38:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765912405] [2023-08-24 05:38:33,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:38:33,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:38:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:38:33,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:38:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:38:33,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:38:33,529 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:38:33,530 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-08-24 05:38:33,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-08-24 05:38:33,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-08-24 05:38:33,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-08-24 05:38:33,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-08-24 05:38:33,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-08-24 05:38:33,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-08-24 05:38:33,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-08-24 05:38:33,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:38:33,535 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-24 05:38:33,539 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:38:33,539 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:38:33,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:38:33 BasicIcfg [2023-08-24 05:38:33,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:38:33,603 INFO L158 Benchmark]: Toolchain (without parser) took 14734.67ms. Allocated memory was 335.5MB in the beginning and 551.6MB in the end (delta: 216.0MB). Free memory was 309.1MB in the beginning and 444.2MB in the end (delta: -135.1MB). Peak memory consumption was 83.0MB. Max. memory is 16.0GB. [2023-08-24 05:38:33,603 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 335.5MB. Free memory was 313.2MB in the beginning and 313.1MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:38:33,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 944.31ms. Allocated memory is still 335.5MB. Free memory was 308.4MB in the beginning and 253.2MB in the end (delta: 55.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. [2023-08-24 05:38:33,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.22ms. Allocated memory is still 335.5MB. Free memory was 253.2MB in the beginning and 249.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 05:38:33,604 INFO L158 Benchmark]: Boogie Preprocessor took 41.62ms. Allocated memory is still 335.5MB. Free memory was 249.7MB in the beginning and 246.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:38:33,604 INFO L158 Benchmark]: RCFGBuilder took 560.81ms. Allocated memory was 335.5MB in the beginning and 459.3MB in the end (delta: 123.7MB). Free memory was 246.9MB in the beginning and 423.4MB in the end (delta: -176.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.0GB. [2023-08-24 05:38:33,605 INFO L158 Benchmark]: TraceAbstraction took 13122.31ms. Allocated memory was 459.3MB in the beginning and 551.6MB in the end (delta: 92.3MB). Free memory was 422.4MB in the beginning and 444.2MB in the end (delta: -21.8MB). Peak memory consumption was 69.4MB. Max. memory is 16.0GB. [2023-08-24 05:38:33,606 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 335.5MB. Free memory was 313.2MB in the beginning and 313.1MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 944.31ms. Allocated memory is still 335.5MB. Free memory was 308.4MB in the beginning and 253.2MB in the end (delta: 55.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.22ms. Allocated memory is still 335.5MB. Free memory was 253.2MB in the beginning and 249.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.62ms. Allocated memory is still 335.5MB. Free memory was 249.7MB in the beginning and 246.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 560.81ms. Allocated memory was 335.5MB in the beginning and 459.3MB in the end (delta: 123.7MB). Free memory was 246.9MB in the beginning and 423.4MB in the end (delta: -176.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.0GB. * TraceAbstraction took 13122.31ms. Allocated memory was 459.3MB in the beginning and 551.6MB in the end (delta: 92.3MB). Free memory was 422.4MB in the beginning and 444.2MB in the end (delta: -21.8MB). Peak memory consumption was 69.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 251]: Unsoundness Warning unspecified type, defaulting to int C: short [251] - GenericResultAtLocation [Line: 251]: Unsoundness Warning unspecified type, defaulting to int C: short [251] - GenericResultAtLocation [Line: 735]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [735] - GenericResultAtLocation [Line: 1691]: Unsoundness Warning unspecified type, defaulting to int C: unsigned long [1691] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.2s, 151 PlacesBefore, 40 PlacesAfterwards, 149 TransitionsBefore, 36 TransitionsAfterwards, 2772 CoEnabledTransitionPairs, 7 FixpointIterations, 74 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 145 TotalNumberOfCompositions, 6373 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2861, independent: 2567, independent conditional: 0, independent unconditional: 2567, dependent: 294, dependent conditional: 0, dependent unconditional: 294, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1468, independent: 1413, independent conditional: 0, independent unconditional: 1413, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2861, independent: 1154, independent conditional: 0, independent unconditional: 1154, dependent: 239, dependent conditional: 0, dependent unconditional: 239, unknown: 1468, unknown conditional: 0, unknown unconditional: 1468] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); [L1746] COND TRUE 0 ret==0 [L1747] 0 int probe_ret; [L1748] 0 struct my_data data; [L1749] CALL, EXPR 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; [L1708] 0 data->shared.a = 0 [L1709] 0 data->shared.b = 0 [L1710] 0 int res = __VERIFIER_nondet_int(); [L1711] COND FALSE 0 !(\read(res)) [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={7:24}, d={7:24}, data={7:0}, data={7:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=-5, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1694] 1 data->shared.a = 1 VAL [__mptr={1158:5}, arg={7:24}, arg={7:24}, data={1158:-19}, dev={7:24}, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={1158:5}, arg={7:24}, arg={7:24}, d={7:24}, data={1158:-19}, data={7:0}, data={7:0}, dev={7:24}, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=-4, res=0, t1={3:0}, t2={4:0}] [L1697] EXPR 1 data->shared.b [L1697] 1 int lb = data->shared.b; [L1715] 0 return 0; [L1749] RET, EXPR 0 my_drv_probe(&data) [L1689] 2 struct device *dev = (struct device*)arg; [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1700] 1 data->shared.b = lb + 1 VAL [__mptr={7:24}, arg={7:24}, arg={7:24}, data={1158:0}, dev={7:24}, lb=-3, pthread_mutex_lock (&data->lock)=0, t1={3:0}, t2={4:0}] [L1749] 0 probe_ret = my_drv_probe(&data) [L1750] COND TRUE 0 probe_ret==0 [L1751] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [\read(t1)=-5, __mptr={7:24}, arg={7:24}, arg={7:24}, data={1158:-19}, data={7:0}, data={7:0}, dev={7:24}, lb=-3, pthread_mutex_lock (&data->lock)=0, status={10:0}, t1={3:0}, t2={4:0}] [L1703] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=-5, \result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={1158:-19}, data={7:0}, data={7:0}, dev={7:24}, lb=-3, pthread_join(t1, &status)={0:0}, pthread_mutex_lock (&data->lock)=0, status={10:0}, t1={3:0}, t2={4:0}] [L1724] 0 data->shared.a = 3 VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={1158:-19}, data={7:0}, data={7:0}, dev={7:24}, lb=-3, pthread_mutex_lock (&data->lock)=0, status={10:0}, t1={3:0}, t2={4:0}] [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={1158:-19}, dev={7:24}, lb=-3, t1={3:0}, t2={4:0}] [L1727] 0 data->shared.b = 3 VAL [\result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={1158:-19}, data={7:0}, data={7:0}, dev={7:24}, lb=-3, status={10:0}, t1={3:0}, t2={4:0}] [L1730] EXPR 0 data->shared.a [L1730] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __mptr={7:24}, arg={7:24}, arg={7:24}, data={1158:-19}, dev={7:24}, expression=0, lb=-3, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: 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: 1675]: 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: 1675]: 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: 1675]: 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: 1675]: 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: 1713]: 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: 1714]: 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 4 procedures, 174 locations, 8 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: 12.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 327 IncrementalHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 14 mSDtfsCounter, 327 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=5, InterpolantAutomatonStates: 15, 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, 0.9s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-08-24 05:38:33,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...