/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_rfi002_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:21:35,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:21:35,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:21:35,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:21:35,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:21:35,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:21:35,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:21:35,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:21:35,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:21:35,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:21:35,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:21:35,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:21:35,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:21:35,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:21:35,321 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:21:35,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:21:35,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:21:35,322 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:21:35,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:21:35,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:21:35,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:21:35,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:21:35,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:21:35,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:21:35,326 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:21:35,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:21:35,327 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:21:35,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:21:35,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:21:35,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:21:35,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:21:35,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:21:35,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:21:35,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:21:35,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:21:35,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:21:35,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:21:35,330 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:21:35,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:21:35,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:21:35,330 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:21:35,333 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 06:21:35,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:21:35,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:21:35,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:21:35,598 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:21:35,598 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:21:35,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi002_tso_bound2.i [2023-08-04 06:21:36,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:21:37,086 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:21:37,088 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi002_tso_bound2.i [2023-08-04 06:21:37,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34609d8e/0a4deb49fae6465088b05d0d107726b6/FLAG76c463688 [2023-08-04 06:21:37,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34609d8e/0a4deb49fae6465088b05d0d107726b6 [2023-08-04 06:21:37,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:21:37,118 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:21:37,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:21:37,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:21:37,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:21:37,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d703c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37, skipping insertion in model container [2023-08-04 06:21:37,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,183 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:21:37,356 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_rfi002_tso_bound2.i[987,1000] [2023-08-04 06:21:37,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:21:37,597 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:21:37,608 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_rfi002_tso_bound2.i[987,1000] [2023-08-04 06:21:37,625 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 06:21:37,626 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 06:21:37,703 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:21:37,734 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:21:37,735 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:21:37,741 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:21:37,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37 WrapperNode [2023-08-04 06:21:37,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:21:37,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:21:37,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:21:37,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:21:37,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,809 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 225 [2023-08-04 06:21:37,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:21:37,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:21:37,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:21:37,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:21:37,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:21:37,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:21:37,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:21:37,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:21:37,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (1/1) ... [2023-08-04 06:21:37,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:21:37,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:21:37,906 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 06:21:37,926 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 06:21:37,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:21:37,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:21:37,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:21:37,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:21:37,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:21:37,945 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:21:37,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:21:37,945 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:21:37,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:21:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:21:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:21:37,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:21:37,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:21:37,947 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 06:21:38,108 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:21:38,110 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:21:38,475 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:21:38,653 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:21:38,653 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 06:21:38,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:21:38 BoogieIcfgContainer [2023-08-04 06:21:38,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:21:38,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:21:38,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:21:38,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:21:38,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:21:37" (1/3) ... [2023-08-04 06:21:38,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc35fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:21:38, skipping insertion in model container [2023-08-04 06:21:38,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:21:37" (2/3) ... [2023-08-04 06:21:38,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc35fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:21:38, skipping insertion in model container [2023-08-04 06:21:38,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:21:38" (3/3) ... [2023-08-04 06:21:38,664 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_rfi002_tso_bound2.i [2023-08-04 06:21:38,671 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:21:38,679 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:21:38,679 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-04 06:21:38,679 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:21:38,735 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:21:38,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 121 transitions, 252 flow [2023-08-04 06:21:38,888 INFO L124 PetriNetUnfolderBase]: 14/240 cut-off events. [2023-08-04 06:21:38,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:38,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 240 events. 14/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 655 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 145. Up to 8 conditions per place. [2023-08-04 06:21:38,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 121 transitions, 252 flow [2023-08-04 06:21:38,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 120 transitions, 248 flow [2023-08-04 06:21:38,903 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:21:38,912 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 120 transitions, 248 flow [2023-08-04 06:21:38,916 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 120 transitions, 248 flow [2023-08-04 06:21:38,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 120 transitions, 248 flow [2023-08-04 06:21:38,975 INFO L124 PetriNetUnfolderBase]: 14/239 cut-off events. [2023-08-04 06:21:38,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:38,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 239 events. 14/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 652 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-04 06:21:38,980 INFO L119 LiptonReduction]: Number of co-enabled transitions 1806 [2023-08-04 06:21:44,064 INFO L134 LiptonReduction]: Checked pairs total: 5481 [2023-08-04 06:21:44,065 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-04 06:21:44,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:21:44,083 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;@278aeefd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:21:44,084 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-04 06:21:44,087 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:21:44,088 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 06:21:44,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:44,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:44,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:21:44,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 06:21:44,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash 655602198, now seen corresponding path program 1 times [2023-08-04 06:21:44,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:44,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382090124] [2023-08-04 06:21:44,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:44,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:44,329 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 06:21:44,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:44,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382090124] [2023-08-04 06:21:44,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382090124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:21:44,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:21:44,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:21:44,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821511316] [2023-08-04 06:21:44,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:21:44,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:21:44,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:21:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:21:44,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228 [2023-08-04 06:21:44,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 06:21:44,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:44,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228 [2023-08-04 06:21:44,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:44,689 INFO L124 PetriNetUnfolderBase]: 643/1083 cut-off events. [2023-08-04 06:21:44,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:44,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 1083 events. 643/1083 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4751 event pairs, 288 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 2172. Up to 1070 conditions per place. [2023-08-04 06:21:44,698 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 28 selfloop transitions, 2 changer transitions 1/32 dead transitions. [2023-08-04 06:21:44,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 134 flow [2023-08-04 06:21:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:21:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:21:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-04 06:21:44,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766081871345029 [2023-08-04 06:21:44,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-04 06:21:44,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-04 06:21:44,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:44,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-04 06:21:44,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 06:21:44,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 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 06:21:44,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 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 06:21:44,730 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 60 flow. Second operand 3 states and 326 transitions. [2023-08-04 06:21:44,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 134 flow [2023-08-04 06:21:44,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:21:44,735 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 68 flow [2023-08-04 06:21:44,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=60, 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=68, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-04 06:21:44,739 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-04 06:21:44,740 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 68 flow [2023-08-04 06:21:44,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 06:21:44,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:44,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:21:44,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:21:44,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 06:21:44,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash 569599996, now seen corresponding path program 1 times [2023-08-04 06:21:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:44,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312191177] [2023-08-04 06:21:44,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:44,856 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 06:21:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312191177] [2023-08-04 06:21:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312191177] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:21:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270464437] [2023-08-04 06:21:44,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:44,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:21:44,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:21:44,861 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 06:21:44,875 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 06:21:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:44,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:21:44,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:21:45,015 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 06:21:45,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:21:45,035 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 06:21:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270464437] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:21:45,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:21:45,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:21:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180427798] [2023-08-04 06:21:45,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:21:45,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:21:45,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:45,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:21:45,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:21:45,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 228 [2023-08-04 06:21:45,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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 06:21:45,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:45,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 228 [2023-08-04 06:21:45,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:45,098 INFO L124 PetriNetUnfolderBase]: 10/30 cut-off events. [2023-08-04 06:21:45,098 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 06:21:45,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 30 events. 10/30 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 6/36 useless extension candidates. Maximal degree in co-relation 75. Up to 22 conditions per place. [2023-08-04 06:21:45,098 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 0 selfloop transitions, 0 changer transitions 15/15 dead transitions. [2023-08-04 06:21:45,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 15 transitions, 69 flow [2023-08-04 06:21:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:21:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:21:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2023-08-04 06:21:45,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44298245614035087 [2023-08-04 06:21:45,102 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 404 transitions. [2023-08-04 06:21:45,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions. [2023-08-04 06:21:45,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:45,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions. [2023-08-04 06:21:45,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 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 06:21:45,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 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 06:21:45,107 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 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 06:21:45,107 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 68 flow. Second operand 4 states and 404 transitions. [2023-08-04 06:21:45,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 15 transitions, 69 flow [2023-08-04 06:21:45,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 15 transitions, 63 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 06:21:45,108 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2023-08-04 06:21:45,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=13, 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=16, PETRI_TRANSITIONS=0} [2023-08-04 06:21:45,109 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -15 predicate places. [2023-08-04 06:21:45,109 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 0 transitions, 0 flow [2023-08-04 06:21:45,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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 06:21:45,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-04 06:21:45,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-04 06:21:45,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-04 06:21:45,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-08-04 06:21:45,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-04 06:21:45,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 06:21:45,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:21:45,322 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:21:45,325 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-04 06:21:45,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 121 transitions, 252 flow [2023-08-04 06:21:45,355 INFO L124 PetriNetUnfolderBase]: 14/240 cut-off events. [2023-08-04 06:21:45,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:45,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 240 events. 14/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 655 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 145. Up to 8 conditions per place. [2023-08-04 06:21:45,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 121 transitions, 252 flow [2023-08-04 06:21:45,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 94 transitions, 198 flow [2023-08-04 06:21:45,357 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:21:45,357 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 94 transitions, 198 flow [2023-08-04 06:21:45,357 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 94 transitions, 198 flow [2023-08-04 06:21:45,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 94 transitions, 198 flow [2023-08-04 06:21:45,371 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-08-04 06:21:45,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:45,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 187 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-08-04 06:21:45,372 INFO L119 LiptonReduction]: Number of co-enabled transitions 796 [2023-08-04 06:21:49,143 INFO L134 LiptonReduction]: Checked pairs total: 2219 [2023-08-04 06:21:49,143 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-08-04 06:21:49,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:21:49,145 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;@278aeefd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:21:49,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 06:21:49,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:21:49,149 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-08-04 06:21:49,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:49,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:49,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:21:49,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:21:49,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash 732456055, now seen corresponding path program 1 times [2023-08-04 06:21:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:49,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660048927] [2023-08-04 06:21:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:49,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:49,186 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 06:21:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660048927] [2023-08-04 06:21:49,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660048927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:21:49,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:21:49,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:21:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317642327] [2023-08-04 06:21:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:21:49,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:21:49,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:49,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:21:49,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:21:49,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 201 [2023-08-04 06:21:49,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 06:21:49,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:49,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 201 [2023-08-04 06:21:49,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:49,279 INFO L124 PetriNetUnfolderBase]: 137/271 cut-off events. [2023-08-04 06:21:49,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:49,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 271 events. 137/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1039 event pairs, 42 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 536. Up to 252 conditions per place. [2023-08-04 06:21:49,283 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 23 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-04 06:21:49,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 114 flow [2023-08-04 06:21:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:21:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:21:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-08-04 06:21:49,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306799336650083 [2023-08-04 06:21:49,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-08-04 06:21:49,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-08-04 06:21:49,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:49,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-08-04 06:21:49,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 06:21:49,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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 06:21:49,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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 06:21:49,289 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 52 flow. Second operand 3 states and 320 transitions. [2023-08-04 06:21:49,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 114 flow [2023-08-04 06:21:49,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:21:49,291 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 60 flow [2023-08-04 06:21:49,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-08-04 06:21:49,293 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2023-08-04 06:21:49,293 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 60 flow [2023-08-04 06:21:49,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 06:21:49,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:49,294 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:21:49,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 06:21:49,294 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:21:49,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1215659857, now seen corresponding path program 1 times [2023-08-04 06:21:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:49,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494424523] [2023-08-04 06:21:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:21:49,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:21:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:21:49,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:21:49,363 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:21:49,363 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 06:21:49,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 06:21:49,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 06:21:49,364 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:21:49,364 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 06:21:49,365 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:21:49,365 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:21:49,392 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:21:49,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 142 transitions, 308 flow [2023-08-04 06:21:49,446 INFO L124 PetriNetUnfolderBase]: 30/486 cut-off events. [2023-08-04 06:21:49,447 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 06:21:49,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 486 events. 30/486 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2080 event pairs, 0 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 352. Up to 18 conditions per place. [2023-08-04 06:21:49,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 142 transitions, 308 flow [2023-08-04 06:21:49,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 141 transitions, 302 flow [2023-08-04 06:21:49,458 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:21:49,458 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 141 transitions, 302 flow [2023-08-04 06:21:49,459 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 141 transitions, 302 flow [2023-08-04 06:21:49,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 141 transitions, 302 flow [2023-08-04 06:21:49,506 INFO L124 PetriNetUnfolderBase]: 30/485 cut-off events. [2023-08-04 06:21:49,506 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 06:21:49,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 485 events. 30/485 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2068 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 351. Up to 18 conditions per place. [2023-08-04 06:21:49,514 INFO L119 LiptonReduction]: Number of co-enabled transitions 4404 [2023-08-04 06:21:53,972 INFO L134 LiptonReduction]: Checked pairs total: 17127 [2023-08-04 06:21:53,972 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-04 06:21:53,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:21:53,974 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;@278aeefd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:21:53,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-04 06:21:53,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:21:53,978 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-04 06:21:53,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:21:53,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:53,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:21:53,982 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-04 06:21:53,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:53,982 INFO L85 PathProgramCache]: Analyzing trace with hash 994437919, now seen corresponding path program 1 times [2023-08-04 06:21:53,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029837840] [2023-08-04 06:21:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:54,043 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 06:21:54,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:54,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029837840] [2023-08-04 06:21:54,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029837840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:21:54,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:21:54,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:21:54,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143052112] [2023-08-04 06:21:54,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:21:54,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:21:54,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:54,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:21:54,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:21:54,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 254 [2023-08-04 06:21:54,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 06:21:54,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:54,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 254 [2023-08-04 06:21:54,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:07,404 INFO L124 PetriNetUnfolderBase]: 82828/110197 cut-off events. [2023-08-04 06:22:07,404 INFO L125 PetriNetUnfolderBase]: For 1386/1386 co-relation queries the response was YES. [2023-08-04 06:22:07,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221613 conditions, 110197 events. 82828/110197 cut-off events. For 1386/1386 co-relation queries the response was YES. Maximal size of possible extension queue 2623. Compared 645813 event pairs, 60468 based on Foata normal form. 0/91332 useless extension candidates. Maximal degree in co-relation 33843. Up to 109661 conditions per place. [2023-08-04 06:22:08,124 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 45 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-04 06:22:08,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 214 flow [2023-08-04 06:22:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-04 06:22:08,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484251968503937 [2023-08-04 06:22:08,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-04 06:22:08,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-04 06:22:08,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:08,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-04 06:22:08,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 06:22:08,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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 06:22:08,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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 06:22:08,131 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 106 flow. Second operand 3 states and 369 transitions. [2023-08-04 06:22:08,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 214 flow [2023-08-04 06:22:08,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 212 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 06:22:08,140 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 116 flow [2023-08-04 06:22:08,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-04 06:22:08,142 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-04 06:22:08,142 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 116 flow [2023-08-04 06:22:08,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 06:22:08,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:08,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:08,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 06:22:08,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-04 06:22:08,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1987786329, now seen corresponding path program 1 times [2023-08-04 06:22:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:08,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673252248] [2023-08-04 06:22:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:08,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:08,216 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 06:22:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673252248] [2023-08-04 06:22:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673252248] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:22:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993521942] [2023-08-04 06:22:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:08,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:22:08,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:22:08,218 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 06:22:08,220 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 06:22:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:08,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:22:08,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:22:08,323 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 06:22:08,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:22:08,338 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 06:22:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993521942] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:22:08,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:22:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:22:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168406608] [2023-08-04 06:22:08,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:22:08,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:22:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:22:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:22:08,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 254 [2023-08-04 06:22:08,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 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 06:22:08,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:08,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 254 [2023-08-04 06:22:08,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:19,222 INFO L124 PetriNetUnfolderBase]: 73744/97243 cut-off events. [2023-08-04 06:22:19,222 INFO L125 PetriNetUnfolderBase]: For 948/948 co-relation queries the response was YES. [2023-08-04 06:22:19,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195384 conditions, 97243 events. 73744/97243 cut-off events. For 948/948 co-relation queries the response was YES. Maximal size of possible extension queue 2471. Compared 551381 event pairs, 35454 based on Foata normal form. 6/81120 useless extension candidates. Maximal degree in co-relation 33834. Up to 96577 conditions per place. [2023-08-04 06:22:19,768 INFO L140 encePairwiseOnDemand]: 250/254 looper letters, 54 selfloop transitions, 3 changer transitions 1/61 dead transitions. [2023-08-04 06:22:19,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 266 flow [2023-08-04 06:22:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:22:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:22:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-04 06:22:19,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47539370078740156 [2023-08-04 06:22:19,773 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-04 06:22:19,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-04 06:22:19,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:19,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-04 06:22:19,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 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 06:22:19,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 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 06:22:19,780 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 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 06:22:19,780 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 116 flow. Second operand 4 states and 483 transitions. [2023-08-04 06:22:19,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 266 flow [2023-08-04 06:22:19,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:22:19,788 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 128 flow [2023-08-04 06:22:19,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2023-08-04 06:22:19,790 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-04 06:22:19,790 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 128 flow [2023-08-04 06:22:19,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 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 06:22:19,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:19,791 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:19,800 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 06:22:19,999 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,SelfDestructingSolverStorable5 [2023-08-04 06:22:20,000 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-04 06:22:20,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash -41459856, now seen corresponding path program 1 times [2023-08-04 06:22:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:20,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127899011] [2023-08-04 06:22:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:22:20,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:20,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127899011] [2023-08-04 06:22:20,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127899011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:22:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:22:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:22:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111725368] [2023-08-04 06:22:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:22:20,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:22:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:22:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:22:20,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 254 [2023-08-04 06:22:20,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 06:22:20,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:20,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 254 [2023-08-04 06:22:20,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:29,963 INFO L124 PetriNetUnfolderBase]: 70348/92435 cut-off events. [2023-08-04 06:22:29,963 INFO L125 PetriNetUnfolderBase]: For 1185/1185 co-relation queries the response was YES. [2023-08-04 06:22:30,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185966 conditions, 92435 events. 70348/92435 cut-off events. For 1185/1185 co-relation queries the response was YES. Maximal size of possible extension queue 2386. Compared 515972 event pairs, 14908 based on Foata normal form. 0/77848 useless extension candidates. Maximal degree in co-relation 89260. Up to 90217 conditions per place. [2023-08-04 06:22:30,402 INFO L140 encePairwiseOnDemand]: 249/254 looper letters, 57 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-04 06:22:30,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 291 flow [2023-08-04 06:22:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-08-04 06:22:30,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131233595800525 [2023-08-04 06:22:30,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-08-04 06:22:30,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-08-04 06:22:30,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:30,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-08-04 06:22:30,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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 06:22:30,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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 06:22:30,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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 06:22:30,408 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 128 flow. Second operand 3 states and 391 transitions. [2023-08-04 06:22:30,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 291 flow [2023-08-04 06:22:30,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 284 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:22:30,410 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 142 flow [2023-08-04 06:22:30,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-08-04 06:22:30,411 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-04 06:22:30,411 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 142 flow [2023-08-04 06:22:30,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 06:22:30,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:30,412 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:30,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 06:22:30,412 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-04 06:22:30,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash -41442286, now seen corresponding path program 1 times [2023-08-04 06:22:30,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:30,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008808654] [2023-08-04 06:22:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:30,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:22:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008808654] [2023-08-04 06:22:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008808654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:22:30,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:22:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 06:22:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810777468] [2023-08-04 06:22:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:22:30,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:22:30,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:30,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:22:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:22:30,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 254 [2023-08-04 06:22:30,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 142 flow. Second operand has 3 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 06:22:30,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:30,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 254 [2023-08-04 06:22:30,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:40,523 INFO L124 PetriNetUnfolderBase]: 70108/92561 cut-off events. [2023-08-04 06:22:40,523 INFO L125 PetriNetUnfolderBase]: For 4300/4300 co-relation queries the response was YES. [2023-08-04 06:22:40,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194456 conditions, 92561 events. 70108/92561 cut-off events. For 4300/4300 co-relation queries the response was YES. Maximal size of possible extension queue 2419. Compared 527576 event pairs, 52372 based on Foata normal form. 0/78052 useless extension candidates. Maximal degree in co-relation 93529. Up to 90985 conditions per place. [2023-08-04 06:22:40,994 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 60 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-04 06:22:40,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 307 flow [2023-08-04 06:22:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-04 06:22:40,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-04 06:22:40,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-04 06:22:40,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-04 06:22:40,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:40,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-04 06:22:40,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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 06:22:40,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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 06:22:41,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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 06:22:41,000 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 142 flow. Second operand 3 states and 381 transitions. [2023-08-04 06:22:41,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 307 flow [2023-08-04 06:22:41,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:22:41,005 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 151 flow [2023-08-04 06:22:41,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-08-04 06:22:41,007 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-04 06:22:41,007 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 151 flow [2023-08-04 06:22:41,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 06:22:41,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:41,008 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:41,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 06:22:41,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-04 06:22:41,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:41,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1285254617, now seen corresponding path program 1 times [2023-08-04 06:22:41,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:41,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054787036] [2023-08-04 06:22:41,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:41,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:22:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054787036] [2023-08-04 06:22:41,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054787036] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:22:41,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:22:41,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:22:41,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503160335] [2023-08-04 06:22:41,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:22:41,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:22:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:41,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:22:41,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:22:41,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 254 [2023-08-04 06:22:41,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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 06:22:41,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:41,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 254 [2023-08-04 06:22:41,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:50,017 INFO L124 PetriNetUnfolderBase]: 63220/83219 cut-off events. [2023-08-04 06:22:50,017 INFO L125 PetriNetUnfolderBase]: For 10188/10188 co-relation queries the response was YES. [2023-08-04 06:22:50,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180027 conditions, 83219 events. 63220/83219 cut-off events. For 10188/10188 co-relation queries the response was YES. Maximal size of possible extension queue 2195. Compared 466551 event pairs, 11968 based on Foata normal form. 0/74860 useless extension candidates. Maximal degree in co-relation 86650. Up to 75697 conditions per place. [2023-08-04 06:22:50,385 INFO L140 encePairwiseOnDemand]: 249/254 looper letters, 65 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-04 06:22:50,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 355 flow [2023-08-04 06:22:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:22:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:22:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-08-04 06:22:50,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183727034120735 [2023-08-04 06:22:50,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-08-04 06:22:50,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-08-04 06:22:50,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:50,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-08-04 06:22:50,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 06:22:50,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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 06:22:50,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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 06:22:50,392 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 151 flow. Second operand 3 states and 395 transitions. [2023-08-04 06:22:50,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 355 flow [2023-08-04 06:22:50,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:22:50,395 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 170 flow [2023-08-04 06:22:50,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2023-08-04 06:22:50,395 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-04 06:22:50,396 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 170 flow [2023-08-04 06:22:50,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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 06:22:50,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:50,396 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:22:50,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 06:22:50,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-04 06:22:50,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:22:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash 481117199, now seen corresponding path program 1 times [2023-08-04 06:22:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:22:50,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656937336] [2023-08-04 06:22:50,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:50,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:22:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:22:50,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:22:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656937336] [2023-08-04 06:22:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656937336] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:22:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262202477] [2023-08-04 06:22:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:22:50,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:22:50,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:22:50,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:22:50,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 06:22:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:22:50,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:22:50,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:22:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:22:50,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:22:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:22:50,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262202477] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:22:50,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:22:50,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 06:22:50,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841657600] [2023-08-04 06:22:50,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:22:50,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:22:50,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:22:50,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:22:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:22:50,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 254 [2023-08-04 06:22:50,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 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 06:22:50,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:22:50,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 254 [2023-08-04 06:22:50,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:22:59,542 INFO L124 PetriNetUnfolderBase]: 60676/80033 cut-off events. [2023-08-04 06:22:59,542 INFO L125 PetriNetUnfolderBase]: For 11474/11474 co-relation queries the response was YES. [2023-08-04 06:22:59,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181103 conditions, 80033 events. 60676/80033 cut-off events. For 11474/11474 co-relation queries the response was YES. Maximal size of possible extension queue 2183. Compared 453198 event pairs, 24352 based on Foata normal form. 252/72184 useless extension candidates. Maximal degree in co-relation 87355. Up to 56593 conditions per place. [2023-08-04 06:22:59,986 INFO L140 encePairwiseOnDemand]: 250/254 looper letters, 90 selfloop transitions, 4 changer transitions 0/97 dead transitions. [2023-08-04 06:22:59,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 97 transitions, 485 flow [2023-08-04 06:22:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:22:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:22:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2023-08-04 06:22:59,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019685039370079 [2023-08-04 06:22:59,988 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2023-08-04 06:22:59,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2023-08-04 06:22:59,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:22:59,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2023-08-04 06:22:59,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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 06:22:59,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 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 06:22:59,992 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 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 06:22:59,992 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 170 flow. Second operand 4 states and 510 transitions. [2023-08-04 06:22:59,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 97 transitions, 485 flow [2023-08-04 06:22:59,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 97 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:22:59,997 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 187 flow [2023-08-04 06:22:59,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2023-08-04 06:22:59,998 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-04 06:22:59,998 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 187 flow [2023-08-04 06:22:59,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 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 06:22:59,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:22:59,999 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:23:00,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 06:23:00,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:23:00,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-04 06:23:00,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:23:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1777559925, now seen corresponding path program 1 times [2023-08-04 06:23:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:23:00,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396355598] [2023-08-04 06:23:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:23:00,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:23:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:23:00,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:23:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:23:00,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:23:00,257 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:23:00,258 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-04 06:23:00,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-04 06:23:00,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-04 06:23:00,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-08-04 06:23:00,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-08-04 06:23:00,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-08-04 06:23:00,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-04 06:23:00,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 06:23:00,259 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:23:00,260 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:23:00,261 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:23:00,261 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:23:00,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:23:00 BasicIcfg [2023-08-04 06:23:00,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:23:00,353 INFO L158 Benchmark]: Toolchain (without parser) took 83234.99ms. Allocated memory was 545.3MB in the beginning and 15.2GB in the end (delta: 14.7GB). Free memory was 494.2MB in the beginning and 12.1GB in the end (delta: -11.6GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. [2023-08-04 06:23:00,353 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory is still 290.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:23:00,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.59ms. Allocated memory is still 545.3MB. Free memory was 494.2MB in the beginning and 466.1MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-04 06:23:00,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.28ms. Allocated memory is still 545.3MB. Free memory was 466.1MB in the beginning and 462.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:23:00,354 INFO L158 Benchmark]: Boogie Preprocessor took 44.23ms. Allocated memory is still 545.3MB. Free memory was 462.6MB in the beginning and 460.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 06:23:00,354 INFO L158 Benchmark]: RCFGBuilder took 800.75ms. Allocated memory is still 545.3MB. Free memory was 459.8MB in the beginning and 454.3MB in the end (delta: 5.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.0GB. [2023-08-04 06:23:00,354 INFO L158 Benchmark]: TraceAbstraction took 81695.40ms. Allocated memory was 545.3MB in the beginning and 15.2GB in the end (delta: 14.7GB). Free memory was 454.3MB in the beginning and 12.1GB in the end (delta: -11.7GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. [2023-08-04 06:23:00,355 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.11ms. Allocated memory is still 339.7MB. Free memory is still 290.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 622.59ms. Allocated memory is still 545.3MB. Free memory was 494.2MB in the beginning and 466.1MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 67.28ms. Allocated memory is still 545.3MB. Free memory was 466.1MB in the beginning and 462.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.23ms. Allocated memory is still 545.3MB. Free memory was 462.6MB in the beginning and 460.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 800.75ms. Allocated memory is still 545.3MB. Free memory was 459.8MB in the beginning and 454.3MB in the end (delta: 5.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.0GB. * TraceAbstraction took 81695.40ms. Allocated memory was 545.3MB in the beginning and 15.2GB in the end (delta: 14.7GB). Free memory was 454.3MB in the beginning and 12.1GB in the end (delta: -11.7GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 121 PlacesBefore, 31 PlacesAfterwards, 120 TransitionsBefore, 26 TransitionsAfterwards, 1806 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 107 TotalNumberOfCompositions, 5481 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1938, independent: 1743, independent conditional: 0, independent unconditional: 1743, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 946, independent: 907, independent conditional: 0, independent unconditional: 907, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1938, independent: 836, independent conditional: 0, independent unconditional: 836, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 946, unknown conditional: 0, unknown unconditional: 946] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 98 PlacesBefore, 26 PlacesAfterwards, 94 TransitionsBefore, 21 TransitionsAfterwards, 796 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 2219 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1084, independent: 962, independent conditional: 0, independent unconditional: 962, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 431, independent: 414, independent conditional: 0, independent unconditional: 414, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1084, independent: 548, independent conditional: 0, independent unconditional: 548, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 431, unknown conditional: 0, unknown unconditional: 431] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 146 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 43 TransitionsAfterwards, 4404 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 112 TotalNumberOfCompositions, 17127 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6892, independent: 6533, independent conditional: 0, independent unconditional: 6533, dependent: 359, dependent conditional: 0, dependent unconditional: 359, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2193, independent: 2122, independent conditional: 0, independent unconditional: 2122, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6892, independent: 4411, independent conditional: 0, independent unconditional: 4411, dependent: 288, dependent conditional: 0, dependent unconditional: 288, unknown: 2193, unknown conditional: 0, unknown unconditional: 2193] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 276, Positive conditional cache size: 0, Positive unconditional cache size: 276, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool y$flush_delayed; [L737] 0 int y$mem_tmp; [L738] 0 _Bool y$r_buff0_thd0; [L739] 0 _Bool y$r_buff0_thd1; [L740] 0 _Bool y$r_buff0_thd2; [L741] 0 _Bool y$r_buff1_thd0; [L742] 0 _Bool y$r_buff1_thd1; [L743] 0 _Bool y$r_buff1_thd2; [L744] 0 _Bool y$read_delayed; [L745] 0 int *y$read_delayed_var; [L746] 0 int y$w_buff0; [L747] 0 _Bool y$w_buff0_used; [L748] 0 int y$w_buff1; [L749] 0 _Bool y$w_buff1_used; [L750] 0 _Bool weak$$choice0; [L751] 0 _Bool weak$$choice2; [L876] 0 pthread_t t1629[2]; [L877] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1629={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L877] COND TRUE 0 asdf<2 [L877] FCALL, FORK 0 pthread_create(&t1629[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1629[asdf], ((void *)0), P0, ((void *)0))=-1, t1629={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L877] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1629={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L877] COND TRUE 0 asdf<2 [L877] FCALL, FORK 0 pthread_create(&t1629[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1629[asdf], ((void *)0), P0, ((void *)0))=0, t1629={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L877] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1629={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L877] COND FALSE 0 !(asdf<2) [L878] 0 pthread_t t1630[2]; [L879] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1629={5:0}, t1630={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L879] COND TRUE 0 asdf<2 [L879] FCALL, FORK 0 pthread_create(&t1630[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1630[asdf], ((void *)0), P1, ((void *)0))=1, t1629={5:0}, t1630={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L795] 3 x$w_buff1 = x$w_buff0 [L796] 3 x$w_buff0 = 2 [L797] 3 x$w_buff1_used = x$w_buff0_used [L798] 3 x$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L800] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L801] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L802] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L803] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L879] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1629={5:0}, t1630={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L879] COND TRUE 0 asdf<2 [L879] FCALL, FORK 0 pthread_create(&t1630[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1630[asdf], ((void *)0), P1, ((void *)0))=2, t1629={5:0}, t1630={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L795] 4 x$w_buff1 = x$w_buff0 [L796] 4 x$w_buff0 = 2 [L797] 4 x$w_buff1_used = x$w_buff0_used [L798] 4 x$w_buff0_used = (_Bool)1 [L799] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 19]: 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, 139 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=1, InterpolantAutomatonStates: 7, 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.3s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 179 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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, 160 locations, 9 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: 70.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 65.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 609 IncrementalHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 4 mSDtfsCounter, 609 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=6, InterpolantAutomatonStates: 20, 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, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 417 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 36/42 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, 139 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, 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, 44 IncrementalHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 44 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=60occurred 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 06:23:00,384 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...