/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:57:51,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:57:51,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:57:51,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:57:51,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:57:51,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:57:51,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:57:51,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:57:51,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:57:51,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:57:51,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:57:51,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:57:51,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:57:51,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:57:51,217 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:57:51,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:57:51,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:57:51,217 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:57:51,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:57:51,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:57:51,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:57:51,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:57:51,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:57:51,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:57:51,219 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:57:51,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:57:51,220 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:57:51,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:57:51,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:57:51,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:57:51,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:57:51,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:57:51,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:57:51,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:57:51,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:57:51,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:57:51,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:57:51,223 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:57:51,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:57:51,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:57:51,223 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:57:51,224 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 05:57:51,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:57:51,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:57:51,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:57:51,442 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:57:51,443 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:57:51,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.oepc_bound2.i [2023-08-04 05:57:52,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:57:52,788 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:57:52,789 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.oepc_bound2.i [2023-08-04 05:57:52,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626bd9160/253cb9bf57254d73b83e1718dabf3f24/FLAGdf697ae75 [2023-08-04 05:57:52,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626bd9160/253cb9bf57254d73b83e1718dabf3f24 [2023-08-04 05:57:52,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:57:52,815 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:57:52,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:57:52,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:57:52,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:57:52,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:57:52" (1/1) ... [2023-08-04 05:57:52,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29552a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:52, skipping insertion in model container [2023-08-04 05:57:52,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:57:52" (1/1) ... [2023-08-04 05:57:52,859 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:57:52,986 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.oepc_bound2.i[945,958] [2023-08-04 05:57:53,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:57:53,148 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:57:53,157 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.oepc_bound2.i[945,958] [2023-08-04 05:57:53,175 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:57:53,176 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:57:53,200 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:57:53,221 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:57:53,222 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:57:53,226 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:57:53,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53 WrapperNode [2023-08-04 05:57:53,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:57:53,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:57:53,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:57:53,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:57:53,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,264 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-08-04 05:57:53,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:57:53,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:57:53,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:57:53,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:57:53,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:57:53,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:57:53,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:57:53,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:57:53,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (1/1) ... [2023-08-04 05:57:53,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:57:53,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:57:53,326 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-04 05:57:53,328 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-04 05:57:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:57:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:57:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:57:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:57:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:57:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:57:53,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:57:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:57:53,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:57:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:57:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:57:53,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:57:53,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:57:53,360 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 05:57:53,471 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:57:53,473 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:57:53,665 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:57:53,751 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:57:53,751 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 05:57:53,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:57:53 BoogieIcfgContainer [2023-08-04 05:57:53,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:57:53,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:57:53,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:57:53,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:57:53,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:57:52" (1/3) ... [2023-08-04 05:57:53,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e657972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:57:53, skipping insertion in model container [2023-08-04 05:57:53,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:57:53" (2/3) ... [2023-08-04 05:57:53,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e657972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:57:53, skipping insertion in model container [2023-08-04 05:57:53,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:57:53" (3/3) ... [2023-08-04 05:57:53,758 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix031.oepc_bound2.i [2023-08-04 05:57:53,764 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:57:53,771 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:57:53,771 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:57:53,771 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:57:53,816 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:57:53,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 110 transitions, 230 flow [2023-08-04 05:57:53,897 INFO L124 PetriNetUnfolderBase]: 14/227 cut-off events. [2023-08-04 05:57:53,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:57:53,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 227 events. 14/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 632 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 136. Up to 8 conditions per place. [2023-08-04 05:57:53,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 110 transitions, 230 flow [2023-08-04 05:57:53,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 110 transitions, 230 flow [2023-08-04 05:57:53,906 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:57:53,912 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 110 transitions, 230 flow [2023-08-04 05:57:53,914 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 110 transitions, 230 flow [2023-08-04 05:57:53,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 110 transitions, 230 flow [2023-08-04 05:57:53,964 INFO L124 PetriNetUnfolderBase]: 14/227 cut-off events. [2023-08-04 05:57:53,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:57:53,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 227 events. 14/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 632 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 136. Up to 8 conditions per place. [2023-08-04 05:57:53,967 INFO L119 LiptonReduction]: Number of co-enabled transitions 1886 [2023-08-04 05:57:56,428 INFO L134 LiptonReduction]: Checked pairs total: 4724 [2023-08-04 05:57:56,429 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-04 05:57:56,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:57:56,450 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;@1eb39520, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:57:56,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:57:56,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:57:56,453 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2023-08-04 05:57:56,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:57:56,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:57:56,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:57:56,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:57:56,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:57:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash 15056050, now seen corresponding path program 1 times [2023-08-04 05:57:56,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:57:56,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89015383] [2023-08-04 05:57:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:57:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:57:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:57:56,765 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-04 05:57:56,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:57:56,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89015383] [2023-08-04 05:57:56,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89015383] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:57:56,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:57:56,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:57:56,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834463595] [2023-08-04 05:57:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:57:56,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:57:56,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:57:56,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:57:56,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:57:56,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 207 [2023-08-04 05:57:56,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-04 05:57:56,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:57:56,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 207 [2023-08-04 05:57:56,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:57:56,996 INFO L124 PetriNetUnfolderBase]: 392/849 cut-off events. [2023-08-04 05:57:56,996 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 05:57:57,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 849 events. 392/849 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4625 event pairs, 80 based on Foata normal form. 35/774 useless extension candidates. Maximal degree in co-relation 1362. Up to 508 conditions per place. [2023-08-04 05:57:57,005 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 32 selfloop transitions, 2 changer transitions 7/43 dead transitions. [2023-08-04 05:57:57,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 177 flow [2023-08-04 05:57:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:57:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:57:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2023-08-04 05:57:57,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5314009661835749 [2023-08-04 05:57:57,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2023-08-04 05:57:57,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2023-08-04 05:57:57,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:57:57,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2023-08-04 05:57:57,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-04 05:57:57,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 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-04 05:57:57,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 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-04 05:57:57,035 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 66 flow. Second operand 3 states and 330 transitions. [2023-08-04 05:57:57,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 177 flow [2023-08-04 05:57:57,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 43 transitions, 177 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:57:57,038 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-04 05:57:57,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-04 05:57:57,041 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-08-04 05:57:57,041 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-04 05:57:57,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-04 05:57:57,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:57:57,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:57:57,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:57:57,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:57:57,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:57:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1588464244, now seen corresponding path program 1 times [2023-08-04 05:57:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:57:57,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753493671] [2023-08-04 05:57:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:57:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:57:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:57:57,109 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-04 05:57:57,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:57:57,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753493671] [2023-08-04 05:57:57,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753493671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:57:57,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:57:57,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:57:57,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121791252] [2023-08-04 05:57:57,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:57:57,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:57:57,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:57:57,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:57:57,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:57:57,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 207 [2023-08-04 05:57:57,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-04 05:57:57,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:57:57,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 207 [2023-08-04 05:57:57,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:57:57,209 INFO L124 PetriNetUnfolderBase]: 270/478 cut-off events. [2023-08-04 05:57:57,210 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-08-04 05:57:57,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 478 events. 270/478 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2001 event pairs, 120 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 1007. Up to 471 conditions per place. [2023-08-04 05:57:57,212 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 21 selfloop transitions, 2 changer transitions 1/26 dead transitions. [2023-08-04 05:57:57,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 112 flow [2023-08-04 05:57:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:57:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:57:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-04 05:57:57,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895330112721417 [2023-08-04 05:57:57,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-04 05:57:57,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-04 05:57:57,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:57:57,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-04 05:57:57,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-04 05:57:57,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 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-04 05:57:57,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 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-04 05:57:57,219 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 3 states and 304 transitions. [2023-08-04 05:57:57,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 112 flow [2023-08-04 05:57:57,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:57:57,220 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 58 flow [2023-08-04 05:57:57,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-04 05:57:57,221 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-04 05:57:57,222 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 58 flow [2023-08-04 05:57:57,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-04 05:57:57,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:57:57,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:57:57,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 05:57:57,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:57:57,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:57:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash 658593474, now seen corresponding path program 1 times [2023-08-04 05:57:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:57:57,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010180128] [2023-08-04 05:57:57,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:57:57,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:57:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:57:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:57:57,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:57:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010180128] [2023-08-04 05:57:57,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010180128] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:57:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808415422] [2023-08-04 05:57:57,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:57:57,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:57:57,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:57:57,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:57:57,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 05:57:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:57:57,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:57:57,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:57:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:57:57,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:57:57,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808415422] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:57:57,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:57:57,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:57:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463204435] [2023-08-04 05:57:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:57:57,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:57:57,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:57:57,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:57:57,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:57:57,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 207 [2023-08-04 05:57:57,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-04 05:57:57,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:57:57,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 207 [2023-08-04 05:57:57,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:57:57,470 INFO L124 PetriNetUnfolderBase]: 258/454 cut-off events. [2023-08-04 05:57:57,470 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 05:57:57,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 454 events. 258/454 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1953 event pairs, 114 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 916. Up to 393 conditions per place. [2023-08-04 05:57:57,472 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 26 selfloop transitions, 2 changer transitions 1/31 dead transitions. [2023-08-04 05:57:57,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 134 flow [2023-08-04 05:57:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:57:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:57:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-04 05:57:57,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975845410628019 [2023-08-04 05:57:57,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-04 05:57:57,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-04 05:57:57,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:57:57,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-04 05:57:57,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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-04 05:57:57,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 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-04 05:57:57,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 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-04 05:57:57,477 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 58 flow. Second operand 3 states and 309 transitions. [2023-08-04 05:57:57,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 134 flow [2023-08-04 05:57:57,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:57:57,479 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 62 flow [2023-08-04 05:57:57,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2023-08-04 05:57:57,481 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-04 05:57:57,481 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 62 flow [2023-08-04 05:57:57,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-04 05:57:57,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:57:57,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:57:57,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 05:57:57,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:57:57,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:57:57,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:57:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash -821755760, now seen corresponding path program 1 times [2023-08-04 05:57:57,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:57:57,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186503056] [2023-08-04 05:57:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:57:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:57:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:57:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:57:57,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:57:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186503056] [2023-08-04 05:57:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186503056] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:57:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855191686] [2023-08-04 05:57:57,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:57:57,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:57:57,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:57:57,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:57:57,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 05:57:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:57:57,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:57:57,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:57:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:57:57,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:57:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:57:57,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855191686] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:57:57,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:57:57,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 05:57:57,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891832687] [2023-08-04 05:57:57,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:57:57,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 05:57:57,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:57:57,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 05:57:57,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 05:57:57,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 207 [2023-08-04 05:57:57,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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-04 05:57:57,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:57:57,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 207 [2023-08-04 05:57:57,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:57:57,931 INFO L124 PetriNetUnfolderBase]: 6/22 cut-off events. [2023-08-04 05:57:57,931 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 05:57:57,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 22 events. 6/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 48. Up to 14 conditions per place. [2023-08-04 05:57:57,931 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 0 selfloop transitions, 0 changer transitions 13/13 dead transitions. [2023-08-04 05:57:57,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 13 transitions, 53 flow [2023-08-04 05:57:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:57:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:57:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-08-04 05:57:57,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45893719806763283 [2023-08-04 05:57:57,933 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-08-04 05:57:57,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-08-04 05:57:57,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:57:57,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-08-04 05:57:57,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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-04 05:57:57,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 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-04 05:57:57,937 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 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-04 05:57:57,939 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 62 flow. Second operand 4 states and 380 transitions. [2023-08-04 05:57:57,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 13 transitions, 53 flow [2023-08-04 05:57:57,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 13 transitions, 51 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:57:57,943 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 05:57:57,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-04 05:57:57,945 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -14 predicate places. [2023-08-04 05:57:57,945 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 05:57:57,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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-04 05:57:57,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:57:57,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:57:57,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:57:57,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 05:57:58,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 05:57:58,155 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 05:57:58,157 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:57:58,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 110 transitions, 230 flow [2023-08-04 05:57:58,190 INFO L124 PetriNetUnfolderBase]: 14/227 cut-off events. [2023-08-04 05:57:58,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:57:58,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 227 events. 14/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 632 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 136. Up to 8 conditions per place. [2023-08-04 05:57:58,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 110 transitions, 230 flow [2023-08-04 05:57:58,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 83 transitions, 176 flow [2023-08-04 05:57:58,192 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:57:58,193 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2023-08-04 05:57:58,193 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2023-08-04 05:57:58,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2023-08-04 05:57:58,208 INFO L124 PetriNetUnfolderBase]: 2/119 cut-off events. [2023-08-04 05:57:58,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:57:58,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 174 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2023-08-04 05:57:58,209 INFO L119 LiptonReduction]: Number of co-enabled transitions 860 [2023-08-04 05:58:00,806 INFO L134 LiptonReduction]: Checked pairs total: 1666 [2023-08-04 05:58:00,806 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-08-04 05:58:00,807 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:58:00,808 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;@1eb39520, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:58:00,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 05:58:00,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:58:00,810 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 05:58:00,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:00,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:00,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:58:00,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:58:00,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash 534071245, now seen corresponding path program 1 times [2023-08-04 05:58:00,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:00,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736507089] [2023-08-04 05:58:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:58:00,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:00,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736507089] [2023-08-04 05:58:00,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736507089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:00,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:00,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:58:00,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149996708] [2023-08-04 05:58:00,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:00,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:00,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:00,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:00,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:00,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 180 [2023-08-04 05:58:00,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-04 05:58:00,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:00,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 180 [2023-08-04 05:58:00,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:00,914 INFO L124 PetriNetUnfolderBase]: 89/193 cut-off events. [2023-08-04 05:58:00,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:00,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 193 events. 89/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 723 event pairs, 24 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 380. Up to 168 conditions per place. [2023-08-04 05:58:00,915 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-08-04 05:58:00,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 102 flow [2023-08-04 05:58:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-08-04 05:58:00,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5592592592592592 [2023-08-04 05:58:00,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-08-04 05:58:00,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-08-04 05:58:00,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:00,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-08-04 05:58:00,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-04 05:58:00,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-04 05:58:00,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-04 05:58:00,936 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 302 transitions. [2023-08-04 05:58:00,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 102 flow [2023-08-04 05:58:00,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:58:00,937 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-04 05:58:00,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-04 05:58:00,937 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-04 05:58:00,937 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-04 05:58:00,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-04 05:58:00,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:00,938 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:58:00,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:58:00,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:58:00,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash -632956075, now seen corresponding path program 1 times [2023-08-04 05:58:00,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573725496] [2023-08-04 05:58:00,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:58:00,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:58:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:58:00,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:58:00,966 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:58:00,966 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 05:58:00,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 05:58:00,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:58:00,966 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:58:00,967 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 05:58:00,967 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:58:00,967 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:58:00,982 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:58:00,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 131 transitions, 286 flow [2023-08-04 05:58:01,057 INFO L124 PetriNetUnfolderBase]: 30/467 cut-off events. [2023-08-04 05:58:01,057 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:58:01,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 467 events. 30/467 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1990 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 339. Up to 18 conditions per place. [2023-08-04 05:58:01,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 131 transitions, 286 flow [2023-08-04 05:58:01,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 131 transitions, 286 flow [2023-08-04 05:58:01,060 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:58:01,060 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 131 transitions, 286 flow [2023-08-04 05:58:01,060 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 131 transitions, 286 flow [2023-08-04 05:58:01,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 131 transitions, 286 flow [2023-08-04 05:58:01,099 INFO L124 PetriNetUnfolderBase]: 30/467 cut-off events. [2023-08-04 05:58:01,100 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:58:01,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 467 events. 30/467 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1990 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 339. Up to 18 conditions per place. [2023-08-04 05:58:01,107 INFO L119 LiptonReduction]: Number of co-enabled transitions 4572 [2023-08-04 05:58:03,500 INFO L134 LiptonReduction]: Checked pairs total: 16879 [2023-08-04 05:58:03,500 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-08-04 05:58:03,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:58:03,502 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;@1eb39520, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:58:03,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:58:03,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:58:03,504 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2023-08-04 05:58:03,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:03,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:03,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:58:03,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:58:03,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash 24966414, now seen corresponding path program 1 times [2023-08-04 05:58:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:03,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254647079] [2023-08-04 05:58:03,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:03,638 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-04 05:58:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:03,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254647079] [2023-08-04 05:58:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254647079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:03,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:03,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:58:03,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514643301] [2023-08-04 05:58:03,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:03,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:03,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:03,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:03,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:03,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 231 [2023-08-04 05:58:03,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-04 05:58:03,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:03,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 231 [2023-08-04 05:58:03,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:06,871 INFO L124 PetriNetUnfolderBase]: 20420/32440 cut-off events. [2023-08-04 05:58:06,871 INFO L125 PetriNetUnfolderBase]: For 443/443 co-relation queries the response was YES. [2023-08-04 05:58:06,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60945 conditions, 32440 events. 20420/32440 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 254282 event pairs, 3947 based on Foata normal form. 837/27699 useless extension candidates. Maximal degree in co-relation 51618. Up to 26049 conditions per place. [2023-08-04 05:58:07,039 INFO L140 encePairwiseOnDemand]: 225/231 looper letters, 53 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-04 05:58:07,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 289 flow [2023-08-04 05:58:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-08-04 05:58:07,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5627705627705628 [2023-08-04 05:58:07,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-08-04 05:58:07,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-08-04 05:58:07,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:07,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-08-04 05:58:07,044 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-04 05:58:07,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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-04 05:58:07,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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-04 05:58:07,047 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 118 flow. Second operand 3 states and 390 transitions. [2023-08-04 05:58:07,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 289 flow [2023-08-04 05:58:07,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 285 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 05:58:07,052 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 133 flow [2023-08-04 05:58:07,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-04 05:58:07,054 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2023-08-04 05:58:07,054 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 133 flow [2023-08-04 05:58:07,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-04 05:58:07,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:07,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:58:07,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:58:07,055 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:58:07,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:07,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1770677217, now seen corresponding path program 1 times [2023-08-04 05:58:07,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:07,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668005308] [2023-08-04 05:58:07,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:07,088 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-04 05:58:07,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668005308] [2023-08-04 05:58:07,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668005308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:07,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:07,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:58:07,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008091577] [2023-08-04 05:58:07,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:07,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:07,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:07,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:07,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 231 [2023-08-04 05:58:07,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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-04 05:58:07,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:07,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 231 [2023-08-04 05:58:07,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:09,799 INFO L124 PetriNetUnfolderBase]: 20048/29070 cut-off events. [2023-08-04 05:58:09,800 INFO L125 PetriNetUnfolderBase]: For 2906/2906 co-relation queries the response was YES. [2023-08-04 05:58:09,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62016 conditions, 29070 events. 20048/29070 cut-off events. For 2906/2906 co-relation queries the response was YES. Maximal size of possible extension queue 1358. Compared 200310 event pairs, 15274 based on Foata normal form. 0/24144 useless extension candidates. Maximal degree in co-relation 40267. Up to 27351 conditions per place. [2023-08-04 05:58:10,024 INFO L140 encePairwiseOnDemand]: 228/231 looper letters, 37 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-04 05:58:10,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 224 flow [2023-08-04 05:58:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-08-04 05:58:10,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180375180375181 [2023-08-04 05:58:10,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-08-04 05:58:10,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-08-04 05:58:10,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:10,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-08-04 05:58:10,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-04 05:58:10,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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-04 05:58:10,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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-04 05:58:10,028 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 133 flow. Second operand 3 states and 359 transitions. [2023-08-04 05:58:10,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 224 flow [2023-08-04 05:58:10,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:58:10,029 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 142 flow [2023-08-04 05:58:10,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-08-04 05:58:10,030 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2023-08-04 05:58:10,030 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 142 flow [2023-08-04 05:58:10,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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-04 05:58:10,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:10,030 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:58:10,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:58:10,030 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:58:10,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:10,031 INFO L85 PathProgramCache]: Analyzing trace with hash -331476362, now seen corresponding path program 1 times [2023-08-04 05:58:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:10,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262284871] [2023-08-04 05:58:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:10,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:58:10,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:58:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:58:10,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:58:10,066 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:58:10,066 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:58:10,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:58:10,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:58:10,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:58:10,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:58:10,067 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:58:10,068 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:58:10,069 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:58:10,069 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:58:10,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:58:10 BasicIcfg [2023-08-04 05:58:10,118 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:58:10,119 INFO L158 Benchmark]: Toolchain (without parser) took 17303.44ms. Allocated memory was 694.2MB in the beginning and 2.0GB in the end (delta: 1.3GB). Free memory was 654.5MB in the beginning and 1.6GB in the end (delta: -955.4MB). Peak memory consumption was 331.9MB. Max. memory is 16.0GB. [2023-08-04 05:58:10,119 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 373.3MB. Free memory is still 325.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:58:10,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.07ms. Allocated memory is still 694.2MB. Free memory was 654.5MB in the beginning and 631.5MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:58:10,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.29ms. Allocated memory is still 694.2MB. Free memory was 631.5MB in the beginning and 629.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:58:10,119 INFO L158 Benchmark]: Boogie Preprocessor took 29.70ms. Allocated memory is still 694.2MB. Free memory was 629.0MB in the beginning and 626.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:58:10,119 INFO L158 Benchmark]: RCFGBuilder took 457.43ms. Allocated memory is still 694.2MB. Free memory was 626.9MB in the beginning and 653.1MB in the end (delta: -26.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-04 05:58:10,120 INFO L158 Benchmark]: TraceAbstraction took 16363.97ms. Allocated memory was 694.2MB in the beginning and 2.0GB in the end (delta: 1.3GB). Free memory was 653.1MB in the beginning and 1.6GB in the end (delta: -956.8MB). Peak memory consumption was 327.7MB. Max. memory is 16.0GB. [2023-08-04 05:58:10,120 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.09ms. Allocated memory is still 373.3MB. Free memory is still 325.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 411.07ms. Allocated memory is still 694.2MB. Free memory was 654.5MB in the beginning and 631.5MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.29ms. Allocated memory is still 694.2MB. Free memory was 631.5MB in the beginning and 629.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.70ms. Allocated memory is still 694.2MB. Free memory was 629.0MB in the beginning and 626.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 457.43ms. Allocated memory is still 694.2MB. Free memory was 626.9MB in the beginning and 653.1MB in the end (delta: -26.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 16363.97ms. Allocated memory was 694.2MB in the beginning and 2.0GB in the end (delta: 1.3GB). Free memory was 653.1MB in the beginning and 1.6GB in the end (delta: -956.8MB). Peak memory consumption was 327.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 111 PlacesBefore, 32 PlacesAfterwards, 110 TransitionsBefore, 28 TransitionsAfterwards, 1886 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 97 TotalNumberOfCompositions, 4724 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2335, independent: 2189, independent conditional: 0, independent unconditional: 2189, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1062, independent: 1034, independent conditional: 0, independent unconditional: 1034, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2335, independent: 1155, independent conditional: 0, independent unconditional: 1155, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1062, unknown conditional: 0, unknown unconditional: 1062] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 87 PlacesBefore, 23 PlacesAfterwards, 83 TransitionsBefore, 18 TransitionsAfterwards, 860 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 1666 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1065, independent: 986, independent conditional: 0, independent unconditional: 986, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 471, independent: 457, independent conditional: 0, independent unconditional: 457, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1065, independent: 529, independent conditional: 0, independent unconditional: 529, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 471, unknown conditional: 0, unknown unconditional: 471] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 136 PlacesBefore, 55 PlacesAfterwards, 131 TransitionsBefore, 47 TransitionsAfterwards, 4572 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 100 TotalNumberOfCompositions, 16879 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5978, independent: 5662, independent conditional: 0, independent unconditional: 5662, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2324, independent: 2280, independent conditional: 0, independent unconditional: 2280, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5978, independent: 3382, independent conditional: 0, independent unconditional: 3382, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 2324, unknown conditional: 0, unknown unconditional: 2324] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 346, Positive conditional cache size: 0, Positive unconditional cache size: 346, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833[2]; [L828] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t833={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L828] COND TRUE 0 asdf<2 [L828] FCALL, FORK 0 pthread_create(&t833[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833[asdf], ((void *)0), P0, ((void *)0))=-1, t833={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L828] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t833={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L828] COND TRUE 0 asdf<2 [L828] FCALL, FORK 0 pthread_create(&t833[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833[asdf], ((void *)0), P0, ((void *)0))=0, t833={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 2 a$w_buff1 = a$w_buff0 [L747] 2 a$w_buff0 = 1 [L748] 2 a$w_buff1_used = a$w_buff0_used [L749] 2 a$w_buff0_used = (_Bool)1 [L750] CALL 2 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=1, a$w_buff1_used=1, a=0, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 128 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 9 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, InterpolantAutomatonStates: 13, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 SizeOfPredicates, 0 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 4/8 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 149 locations, 6 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: 9.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 2 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=2, InterpolantAutomatonStates: 6, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 128 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: 2.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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-04 05:58:10,163 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...