/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/added_bound_to_unbounded/pthread-ext_04_incdec_cas_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 04:17:16,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 04:17:16,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 04:17:16,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 04:17:16,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 04:17:16,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 04:17:16,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 04:17:16,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 04:17:16,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 04:17:16,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 04:17:16,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 04:17:16,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 04:17:16,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 04:17:16,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 04:17:16,518 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 04:17:16,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 04:17:16,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 04:17:16,518 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 04:17:16,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 04:17:16,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 04:17:16,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 04:17:16,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 04:17:16,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 04:17:16,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 04:17:16,520 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 04:17:16,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 04:17:16,520 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 04:17:16,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 04:17:16,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 04:17:16,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 04:17:16,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:17:16,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 04:17:16,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 04:17:16,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 04:17:16,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 04:17:16,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 04:17:16,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 04:17:16,523 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 04:17:16,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 04:17:16,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 04:17:16,524 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 04:17:16,524 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 04:17:16,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 04:17:16,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 04:17:16,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 04:17:16,746 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 04:17:16,747 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 04:17:16,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_04_incdec_cas_bound2.i [2023-08-04 04:17:17,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 04:17:18,142 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 04:17:18,143 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_04_incdec_cas_bound2.i [2023-08-04 04:17:18,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694d127a2/1b5b57531065455fb63499c5ac9139b3/FLAG2b4090063 [2023-08-04 04:17:18,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694d127a2/1b5b57531065455fb63499c5ac9139b3 [2023-08-04 04:17:18,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 04:17:18,170 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 04:17:18,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 04:17:18,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 04:17:18,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 04:17:18,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4a65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18, skipping insertion in model container [2023-08-04 04:17:18,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,214 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 04:17:18,485 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_04_incdec_cas_bound2.i[30285,30298] [2023-08-04 04:17:18,492 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_04_incdec_cas_bound2.i[30729,30742] [2023-08-04 04:17:18,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:17:18,514 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 04:17:18,536 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-04 04:17:18,539 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-04 04:17:18,547 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [686] [2023-08-04 04:17:18,548 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [687] [2023-08-04 04:17:18,548 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [688] [2023-08-04 04:17:18,548 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [689] [2023-08-04 04:17:18,548 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [690] [2023-08-04 04:17:18,550 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [701] [2023-08-04 04:17:18,550 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [702] [2023-08-04 04:17:18,550 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [703] [2023-08-04 04:17:18,551 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [704] [2023-08-04 04:17:18,551 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_04_incdec_cas_bound2.i[30285,30298] [2023-08-04 04:17:18,552 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: inline unsigned [708] [2023-08-04 04:17:18,552 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [709] [2023-08-04 04:17:18,555 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [722] [2023-08-04 04:17:18,555 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_04_incdec_cas_bound2.i[30729,30742] [2023-08-04 04:17:18,556 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: inline unsigned [726] [2023-08-04 04:17:18,556 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [727] [2023-08-04 04:17:18,559 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:17:18,585 INFO L206 MainTranslator]: Completed translation [2023-08-04 04:17:18,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18 WrapperNode [2023-08-04 04:17:18,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 04:17:18,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 04:17:18,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 04:17:18,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 04:17:18,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,624 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2023-08-04 04:17:18,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 04:17:18,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 04:17:18,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 04:17:18,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 04:17:18,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 04:17:18,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 04:17:18,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 04:17:18,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 04:17:18,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (1/1) ... [2023-08-04 04:17:18,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:17:18,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:17:18,695 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 04:17:18,713 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 04:17:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 04:17:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-04 04:17:18,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-04 04:17:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 04:17:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 04:17:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 04:17:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 04:17:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 04:17:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 04:17:18,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 04:17:18,726 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 04:17:18,830 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 04:17:18,832 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 04:17:19,082 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 04:17:19,311 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 04:17:19,311 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 04:17:19,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:17:19 BoogieIcfgContainer [2023-08-04 04:17:19,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 04:17:19,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 04:17:19,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 04:17:19,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 04:17:19,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 04:17:18" (1/3) ... [2023-08-04 04:17:19,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea1afb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:17:19, skipping insertion in model container [2023-08-04 04:17:19,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:17:18" (2/3) ... [2023-08-04 04:17:19,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea1afb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:17:19, skipping insertion in model container [2023-08-04 04:17:19,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:17:19" (3/3) ... [2023-08-04 04:17:19,324 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-ext_04_incdec_cas_bound2.i [2023-08-04 04:17:19,332 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 04:17:19,341 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 04:17:19,341 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 04:17:19,342 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 04:17:19,434 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 04:17:19,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:19,508 INFO L124 PetriNetUnfolderBase]: 9/112 cut-off events. [2023-08-04 04:17:19,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:17:19,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 9/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-04 04:17:19,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:19,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:19,521 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:17:19,532 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:19,534 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:19,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:19,563 INFO L124 PetriNetUnfolderBase]: 9/112 cut-off events. [2023-08-04 04:17:19,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:17:19,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 9/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-04 04:17:19,566 INFO L119 LiptonReduction]: Number of co-enabled transitions 2080 [2023-08-04 04:17:22,870 INFO L134 LiptonReduction]: Checked pairs total: 2550 [2023-08-04 04:17:22,870 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-08-04 04:17:22,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:17:22,902 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;@109ef6a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:17:22,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 04:17:22,910 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:17:22,910 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-04 04:17:22,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:17:22,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:17:22,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 04:17:22,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:17:22,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:17:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash 531499607, now seen corresponding path program 1 times [2023-08-04 04:17:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:17:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238304787] [2023-08-04 04:17:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:17:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:17:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:17:23,138 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 04:17:23,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:17:23,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238304787] [2023-08-04 04:17:23,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238304787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:17:23,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:17:23,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:17:23,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427593719] [2023-08-04 04:17:23,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:17:23,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-04 04:17:23,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:17:23,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-04 04:17:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-04 04:17:23,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 191 [2023-08-04 04:17:23,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 27 transitions, 59 flow. Second operand has 2 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 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 04:17:23,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:17:23,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 191 [2023-08-04 04:17:23,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:17:23,272 INFO L124 PetriNetUnfolderBase]: 62/126 cut-off events. [2023-08-04 04:17:23,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:17:23,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 126 events. 62/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 383 event pairs, 42 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 242. Up to 126 conditions per place. [2023-08-04 04:17:23,275 INFO L140 encePairwiseOnDemand]: 189/191 looper letters, 17 selfloop transitions, 0 changer transitions 7/25 dead transitions. [2023-08-04 04:17:23,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 25 transitions, 103 flow [2023-08-04 04:17:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-04 04:17:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-04 04:17:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 210 transitions. [2023-08-04 04:17:23,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5497382198952879 [2023-08-04 04:17:23,290 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 210 transitions. [2023-08-04 04:17:23,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 210 transitions. [2023-08-04 04:17:23,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:17:23,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 210 transitions. [2023-08-04 04:17:23,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 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 04:17:23,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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 04:17:23,306 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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 04:17:23,308 INFO L175 Difference]: Start difference. First operand has 23 places, 27 transitions, 59 flow. Second operand 2 states and 210 transitions. [2023-08-04 04:17:23,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 25 transitions, 103 flow [2023-08-04 04:17:23,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 103 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:17:23,312 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 41 flow [2023-08-04 04:17:23,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=41, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-08-04 04:17:23,319 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places. [2023-08-04 04:17:23,319 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 41 flow [2023-08-04 04:17:23,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 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 04:17:23,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:17:23,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:17:23,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 04:17:23,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:17:23,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:17:23,320 INFO L85 PathProgramCache]: Analyzing trace with hash -326460418, now seen corresponding path program 1 times [2023-08-04 04:17:23,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:17:23,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63108475] [2023-08-04 04:17:23,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:17:23,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:17:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:17:23,944 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 04:17:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:17:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63108475] [2023-08-04 04:17:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63108475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:17:23,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:17:23,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:17:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341302839] [2023-08-04 04:17:23,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:17:23,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:17:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:17:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:17:23,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:17:24,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 191 [2023-08-04 04:17:24,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 41 flow. Second operand has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 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 04:17:24,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:17:24,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 191 [2023-08-04 04:17:24,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:17:24,073 INFO L124 PetriNetUnfolderBase]: 28/68 cut-off events. [2023-08-04 04:17:24,074 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:17:24,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 68 events. 28/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 176 event pairs, 6 based on Foata normal form. 4/54 useless extension candidates. Maximal degree in co-relation 138. Up to 40 conditions per place. [2023-08-04 04:17:24,075 INFO L140 encePairwiseOnDemand]: 187/191 looper letters, 15 selfloop transitions, 4 changer transitions 2/22 dead transitions. [2023-08-04 04:17:24,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 22 transitions, 91 flow [2023-08-04 04:17:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:17:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:17:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 351 transitions. [2023-08-04 04:17:24,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594240837696335 [2023-08-04 04:17:24,088 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 351 transitions. [2023-08-04 04:17:24,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 351 transitions. [2023-08-04 04:17:24,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:17:24,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 351 transitions. [2023-08-04 04:17:24,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 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 04:17:24,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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 04:17:24,094 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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 04:17:24,094 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 41 flow. Second operand 4 states and 351 transitions. [2023-08-04 04:17:24,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 22 transitions, 91 flow [2023-08-04 04:17:24,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 22 transitions, 91 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:17:24,095 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 50 flow [2023-08-04 04:17:24,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=31, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=15} [2023-08-04 04:17:24,096 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -3 predicate places. [2023-08-04 04:17:24,097 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 15 transitions, 50 flow [2023-08-04 04:17:24,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 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 04:17:24,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:17:24,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:17:24,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 04:17:24,098 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:17:24,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:17:24,098 INFO L85 PathProgramCache]: Analyzing trace with hash -328498609, now seen corresponding path program 1 times [2023-08-04 04:17:24,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:17:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580912573] [2023-08-04 04:17:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:17:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:17:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:17:24,650 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 04:17:24,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:17:24,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580912573] [2023-08-04 04:17:24,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580912573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:17:24,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:17:24,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-04 04:17:24,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142219502] [2023-08-04 04:17:24,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:17:24,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 04:17:24,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:17:24,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 04:17:24,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-04 04:17:24,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 191 [2023-08-04 04:17:24,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 50 flow. Second operand has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 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 04:17:24,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:17:24,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 191 [2023-08-04 04:17:24,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:17:24,982 INFO L124 PetriNetUnfolderBase]: 34/89 cut-off events. [2023-08-04 04:17:24,982 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 04:17:24,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 89 events. 34/89 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 239 event pairs, 0 based on Foata normal form. 4/84 useless extension candidates. Maximal degree in co-relation 208. Up to 41 conditions per place. [2023-08-04 04:17:24,983 INFO L140 encePairwiseOnDemand]: 184/191 looper letters, 22 selfloop transitions, 13 changer transitions 0/36 dead transitions. [2023-08-04 04:17:24,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 170 flow [2023-08-04 04:17:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-04 04:17:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-04 04:17:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 766 transitions. [2023-08-04 04:17:24,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40104712041884816 [2023-08-04 04:17:24,986 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 766 transitions. [2023-08-04 04:17:24,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 766 transitions. [2023-08-04 04:17:24,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:17:24,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 766 transitions. [2023-08-04 04:17:24,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.6) internal successors, (766), 10 states have internal predecessors, (766), 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 04:17:24,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 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 04:17:24,992 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 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 04:17:24,993 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 50 flow. Second operand 10 states and 766 transitions. [2023-08-04 04:17:24,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 170 flow [2023-08-04 04:17:24,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:17:24,994 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 108 flow [2023-08-04 04:17:24,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=108, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-08-04 04:17:24,995 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2023-08-04 04:17:24,995 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 108 flow [2023-08-04 04:17:24,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 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 04:17:24,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:17:24,996 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:17:24,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 04:17:24,996 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:17:24,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:17:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash -836963770, now seen corresponding path program 1 times [2023-08-04 04:17:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:17:24,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365324183] [2023-08-04 04:17:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:17:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:17:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:17:25,630 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 04:17:25,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:17:25,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365324183] [2023-08-04 04:17:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365324183] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:17:25,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491600014] [2023-08-04 04:17:25,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:17:25,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:17:25,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:17:25,641 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 04:17:25,647 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 04:17:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:17:25,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-04 04:17:25,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:17:25,852 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-04 04:17:25,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-04 04:17:25,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:17:26,007 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-04 04:17:26,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 04:17:26,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:17:26,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:17:26,301 INFO L322 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-04 04:17:26,302 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 383 [2023-08-04 04:17:26,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-04 04:17:26,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-04 04:17:26,391 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-04 04:17:26,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-04 04:17:26,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:17:26,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:17:26,795 INFO L322 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-08-04 04:17:26,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 260 treesize of output 238 [2023-08-04 04:17:27,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:17:27,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 52 [2023-08-04 04:17:27,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-08-04 04:17:27,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-08-04 04:17:27,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:17:27,560 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:17:27,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 73 [2023-08-04 04:17:27,829 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-04 04:17:27,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2023-08-04 04:17:27,869 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 04:17:27,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:17:27,951 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_110))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) is different from false [2023-08-04 04:17:33,388 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 04:17:33,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491600014] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:17:33,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:17:33,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-08-04 04:17:33,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294347090] [2023-08-04 04:17:33,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:17:33,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 04:17:33,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:17:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 04:17:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=285, Unknown=19, NotChecked=36, Total=420 [2023-08-04 04:17:34,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 191 [2023-08-04 04:17:34,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 108 flow. Second operand has 21 states, 21 states have (on average 56.42857142857143) internal successors, (1185), 21 states have internal predecessors, (1185), 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 04:17:34,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:17:34,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 191 [2023-08-04 04:17:34,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:17:43,789 WARN L233 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 121 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:17:48,029 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse5 (mod .cse11 4294967296))) (let ((.cse0 (= .cse1 .cse5)) (.cse6 (+ 1 .cse11))) (and (or (not .cse0) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int) (v_ArrVal_106 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_101 (Array Int Int)) (v_ArrVal_104 (Array Int Int))) (let ((.cse2 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_101) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_106) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_109) |c_~#value~0.base| v_ArrVal_104) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_110))) (or (< .cse1 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse2 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|))))) (or .cse0 (forall ((v_ArrVal_110 (Array Int Int)) (v_ArrVal_103 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_103) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_110))) (or (= (mod (select v_ArrVal_103 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int) (v_ArrVal_106 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_101 (Array Int Int)) (v_ArrVal_104 (Array Int Int))) (let ((.cse4 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_101) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_106) |c_~#value~0.base|) |c_~#value~0.offset| .cse6)) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_109) |c_~#value~0.base| v_ArrVal_104) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_110))) (or (not (= (mod (select (select .cse4 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse5 (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|)))) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int) (v_ArrVal_106 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_100 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_101 (Array Int Int)) (|v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_63| Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_100))) (let ((.cse7 (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse8 (store (store (store (store .cse9 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_101) |c_~#value~0.base| (store (select (store .cse9 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_106) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse7 1))) |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_63| (store (select (store (store .cse9 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_109) |c_~#value~0.base| v_ArrVal_104) |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_63|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_110))) (or (< (mod .cse7 4294967296) (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_63|) 0)) (not (= (mod (select (select .cse8 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|)))))) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| Int) (v_ArrVal_106 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_101 (Array Int Int)) (|v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_63| Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse10 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_101) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_106) |c_~#value~0.base|) |c_~#value~0.offset| .cse6)) |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_63| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9| v_ArrVal_109) |c_~#value~0.base| v_ArrVal_104) |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_63|) 0 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_110))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_63|) 0)) (< .cse5 (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_9|) (not (= (mod (select (select .cse10 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))))))) is different from false [2023-08-04 04:17:48,216 INFO L124 PetriNetUnfolderBase]: 13/59 cut-off events. [2023-08-04 04:17:48,216 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 04:17:48,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 59 events. 13/59 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 134 event pairs, 0 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 175. Up to 23 conditions per place. [2023-08-04 04:17:48,217 INFO L140 encePairwiseOnDemand]: 182/191 looper letters, 17 selfloop transitions, 13 changer transitions 6/37 dead transitions. [2023-08-04 04:17:48,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 217 flow [2023-08-04 04:17:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 04:17:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 04:17:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 641 transitions. [2023-08-04 04:17:48,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3050928129462161 [2023-08-04 04:17:48,221 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 641 transitions. [2023-08-04 04:17:48,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 641 transitions. [2023-08-04 04:17:48,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:17:48,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 641 transitions. [2023-08-04 04:17:48,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 58.27272727272727) internal successors, (641), 11 states have internal predecessors, (641), 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 04:17:48,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 191.0) internal successors, (2292), 12 states have internal predecessors, (2292), 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 04:17:48,228 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 191.0) internal successors, (2292), 12 states have internal predecessors, (2292), 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 04:17:48,228 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 108 flow. Second operand 11 states and 641 transitions. [2023-08-04 04:17:48,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 217 flow [2023-08-04 04:17:48,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:17:48,232 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 161 flow [2023-08-04 04:17:48,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=161, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-04 04:17:48,234 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 20 predicate places. [2023-08-04 04:17:48,234 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 161 flow [2023-08-04 04:17:48,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 56.42857142857143) internal successors, (1185), 21 states have internal predecessors, (1185), 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 04:17:48,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:17:48,235 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:17:48,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 04:17:48,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:17:48,436 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:17:48,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:17:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash -839262173, now seen corresponding path program 1 times [2023-08-04 04:17:48,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:17:48,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146686628] [2023-08-04 04:17:48,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:17:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:17:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:17:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 04:17:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:17:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146686628] [2023-08-04 04:17:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146686628] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:17:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877591529] [2023-08-04 04:17:48,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:17:48,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:17:48,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:17:48,555 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 04:17:48,562 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 04:17:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:17:48,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:17:48,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:17:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 04:17:48,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:17:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 04:17:48,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877591529] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:17:48,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:17:48,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 04:17:48,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040775686] [2023-08-04 04:17:48,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:17:48,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:17:48,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:17:48,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:17:48,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:17:48,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 191 [2023-08-04 04:17:48,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 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 04:17:48,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:17:48,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 191 [2023-08-04 04:17:48,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:17:49,049 INFO L124 PetriNetUnfolderBase]: 8/40 cut-off events. [2023-08-04 04:17:49,049 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-08-04 04:17:49,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 40 events. 8/40 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 6/46 useless extension candidates. Maximal degree in co-relation 143. Up to 28 conditions per place. [2023-08-04 04:17:49,050 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 17 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2023-08-04 04:17:49,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 22 transitions, 175 flow [2023-08-04 04:17:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:17:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:17:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-08-04 04:17:49,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47774869109947643 [2023-08-04 04:17:49,052 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-08-04 04:17:49,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-08-04 04:17:49,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:17:49,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-08-04 04:17:49,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 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 04:17:49,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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 04:17:49,055 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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 04:17:49,055 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 161 flow. Second operand 4 states and 365 transitions. [2023-08-04 04:17:49,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 22 transitions, 175 flow [2023-08-04 04:17:49,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 147 flow, removed 2 selfloop flow, removed 9 redundant places. [2023-08-04 04:17:49,061 INFO L231 Difference]: Finished difference. Result has 31 places, 17 transitions, 87 flow [2023-08-04 04:17:49,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2023-08-04 04:17:49,064 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 8 predicate places. [2023-08-04 04:17:49,064 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 87 flow [2023-08-04 04:17:49,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 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 04:17:49,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:17:49,065 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 04:17:49,073 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 04:17:49,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:17:49,272 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:17:49,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:17:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2101480084, now seen corresponding path program 1 times [2023-08-04 04:17:49,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:17:49,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671984413] [2023-08-04 04:17:49,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:17:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:17:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:17:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:17:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:17:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671984413] [2023-08-04 04:17:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671984413] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:17:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383265926] [2023-08-04 04:17:51,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:17:51,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:17:51,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:17:51,567 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 04:17:51,571 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 04:17:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:17:51,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-04 04:17:51,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:17:52,784 INFO L322 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-08-04 04:17:52,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2023-08-04 04:17:52,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-04 04:17:52,866 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-04 04:17:52,902 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-04 04:17:54,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-08-04 04:17:54,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:17:54,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:17:54,333 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 14 [2023-08-04 04:17:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:17:54,614 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:17:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383265926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:17:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:17:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-08-04 04:17:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336603863] [2023-08-04 04:17:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:17:54,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-04 04:17:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:17:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-04 04:17:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-08-04 04:17:55,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191 [2023-08-04 04:17:55,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 87 flow. Second operand has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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 04:17:55,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:17:55,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191 [2023-08-04 04:17:55,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:17:55,273 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2023-08-04 04:17:55,273 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-04 04:17:55,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 35 events. 6/35 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 114. Up to 12 conditions per place. [2023-08-04 04:17:55,274 INFO L140 encePairwiseOnDemand]: 185/191 looper letters, 0 selfloop transitions, 0 changer transitions 20/20 dead transitions. [2023-08-04 04:17:55,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 20 transitions, 136 flow [2023-08-04 04:17:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:17:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:17:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2023-08-04 04:17:55,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45549738219895286 [2023-08-04 04:17:55,276 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 522 transitions. [2023-08-04 04:17:55,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 522 transitions. [2023-08-04 04:17:55,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:17:55,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 522 transitions. [2023-08-04 04:17:55,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 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 04:17:55,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 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 04:17:55,279 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 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 04:17:55,280 INFO L175 Difference]: Start difference. First operand has 31 places, 17 transitions, 87 flow. Second operand 6 states and 522 transitions. [2023-08-04 04:17:55,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 20 transitions, 136 flow [2023-08-04 04:17:55,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 116 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-04 04:17:55,281 INFO L231 Difference]: Finished difference. Result has 28 places, 0 transitions, 0 flow [2023-08-04 04:17:55,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=28, PETRI_TRANSITIONS=0} [2023-08-04 04:17:55,282 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-08-04 04:17:55,282 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 0 transitions, 0 flow [2023-08-04 04:17:55,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 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 04:17:55,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 04:17:55,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 04:17:55,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 04:17:55,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 04:17:55,296 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 04:17:55,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:17:55,493 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-04 04:17:55,494 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-04 04:17:55,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:55,505 INFO L124 PetriNetUnfolderBase]: 9/112 cut-off events. [2023-08-04 04:17:55,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:17:55,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 9/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-04 04:17:55,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:55,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:55,507 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:17:55,507 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:55,507 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:55,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 102 transitions, 209 flow [2023-08-04 04:17:55,516 INFO L124 PetriNetUnfolderBase]: 9/112 cut-off events. [2023-08-04 04:17:55,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:17:55,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 9/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-04 04:17:55,519 INFO L119 LiptonReduction]: Number of co-enabled transitions 2080 [2023-08-04 04:18:12,505 INFO L134 LiptonReduction]: Checked pairs total: 2539 [2023-08-04 04:18:12,505 INFO L136 LiptonReduction]: Total number of compositions: 88 [2023-08-04 04:18:12,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 04:18:12,507 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;@109ef6a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:18:12,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 04:18:12,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:18:12,509 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-04 04:18:12,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:18:12,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:18:12,509 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 04:18:12,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:18:12,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:18:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1166441191, now seen corresponding path program 1 times [2023-08-04 04:18:12,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:18:12,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474416803] [2023-08-04 04:18:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:18:12,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:18:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:18:12,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 04:18:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:18:12,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 04:18:12,539 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 04:18:12,539 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 04:18:12,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 04:18:12,539 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 04:18:12,540 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 04:18:12,540 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 04:18:12,540 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 04:18:12,580 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 04:18:12,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 168 transitions, 348 flow [2023-08-04 04:18:12,599 INFO L124 PetriNetUnfolderBase]: 17/193 cut-off events. [2023-08-04 04:18:12,600 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 04:18:12,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 17/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 608 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 145. Up to 6 conditions per place. [2023-08-04 04:18:12,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 168 transitions, 348 flow [2023-08-04 04:18:12,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 168 transitions, 348 flow [2023-08-04 04:18:12,602 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:18:12,602 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 168 transitions, 348 flow [2023-08-04 04:18:12,603 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 168 transitions, 348 flow [2023-08-04 04:18:12,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 168 transitions, 348 flow [2023-08-04 04:18:12,620 INFO L124 PetriNetUnfolderBase]: 17/193 cut-off events. [2023-08-04 04:18:12,620 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 04:18:12,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 17/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 608 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 145. Up to 6 conditions per place. [2023-08-04 04:18:12,627 INFO L119 LiptonReduction]: Number of co-enabled transitions 12740 [2023-08-04 04:18:39,521 INFO L134 LiptonReduction]: Checked pairs total: 18472 [2023-08-04 04:18:39,521 INFO L136 LiptonReduction]: Total number of compositions: 145 [2023-08-04 04:18:39,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:18:39,523 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;@109ef6a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:18:39,523 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-04 04:18:39,525 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:18:39,525 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-08-04 04:18:39,525 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 04:18:39,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:18:39,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 04:18:39,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:18:39,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:18:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1390179294, now seen corresponding path program 1 times [2023-08-04 04:18:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:18:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086518110] [2023-08-04 04:18:39,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:18:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:18:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:18:39,541 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 04:18:39,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:18:39,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086518110] [2023-08-04 04:18:39,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086518110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:18:39,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:18:39,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:18:39,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252713877] [2023-08-04 04:18:39,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:18:39,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-04 04:18:39,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:18:39,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-04 04:18:39,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-04 04:18:39,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 313 [2023-08-04 04:18:39,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:18:39,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:18:39,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 313 [2023-08-04 04:18:39,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:18:40,183 INFO L124 PetriNetUnfolderBase]: 2385/3497 cut-off events. [2023-08-04 04:18:40,184 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-08-04 04:18:40,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7047 conditions, 3497 events. 2385/3497 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 17206 event pairs, 1725 based on Foata normal form. 0/2298 useless extension candidates. Maximal degree in co-relation 1665. Up to 3477 conditions per place. [2023-08-04 04:18:40,202 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 46 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2023-08-04 04:18:40,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 200 flow [2023-08-04 04:18:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-04 04:18:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-04 04:18:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 348 transitions. [2023-08-04 04:18:40,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5559105431309904 [2023-08-04 04:18:40,204 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 348 transitions. [2023-08-04 04:18:40,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 348 transitions. [2023-08-04 04:18:40,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:18:40,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 348 transitions. [2023-08-04 04:18:40,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 174.0) internal successors, (348), 2 states have internal predecessors, (348), 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 04:18:40,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 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 04:18:40,207 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 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 04:18:40,207 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 116 flow. Second operand 2 states and 348 transitions. [2023-08-04 04:18:40,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 200 flow [2023-08-04 04:18:40,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 198 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 04:18:40,209 INFO L231 Difference]: Finished difference. Result has 44 places, 48 transitions, 106 flow [2023-08-04 04:18:40,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=48} [2023-08-04 04:18:40,210 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-08-04 04:18:40,211 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 48 transitions, 106 flow [2023-08-04 04:18:40,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:18:40,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:18:40,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:18:40,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 04:18:40,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:18:40,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:18:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash 233487946, now seen corresponding path program 1 times [2023-08-04 04:18:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:18:40,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550114855] [2023-08-04 04:18:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:18:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:18:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:18:40,538 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 04:18:40,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:18:40,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550114855] [2023-08-04 04:18:40,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550114855] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:18:40,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:18:40,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:18:40,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699009429] [2023-08-04 04:18:40,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:18:40,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:18:40,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:18:40,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:18:40,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:18:41,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 313 [2023-08-04 04:18:41,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 48 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 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 04:18:41,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:18:41,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 313 [2023-08-04 04:18:41,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:18:42,646 INFO L124 PetriNetUnfolderBase]: 2235/3339 cut-off events. [2023-08-04 04:18:42,647 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-08-04 04:18:42,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6720 conditions, 3339 events. 2235/3339 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 17731 event pairs, 519 based on Foata normal form. 0/2268 useless extension candidates. Maximal degree in co-relation 6715. Up to 2573 conditions per place. [2023-08-04 04:18:42,662 INFO L140 encePairwiseOnDemand]: 306/313 looper letters, 82 selfloop transitions, 6 changer transitions 0/90 dead transitions. [2023-08-04 04:18:42,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 90 transitions, 371 flow [2023-08-04 04:18:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:18:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:18:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 650 transitions. [2023-08-04 04:18:42,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191693290734825 [2023-08-04 04:18:42,664 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 650 transitions. [2023-08-04 04:18:42,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 650 transitions. [2023-08-04 04:18:42,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:18:42,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 650 transitions. [2023-08-04 04:18:42,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 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 04:18:42,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 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 04:18:42,670 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 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 04:18:42,671 INFO L175 Difference]: Start difference. First operand has 44 places, 48 transitions, 106 flow. Second operand 4 states and 650 transitions. [2023-08-04 04:18:42,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 90 transitions, 371 flow [2023-08-04 04:18:42,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 90 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:18:42,674 INFO L231 Difference]: Finished difference. Result has 49 places, 53 transitions, 153 flow [2023-08-04 04:18:42,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=49, PETRI_TRANSITIONS=53} [2023-08-04 04:18:42,676 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-04 04:18:42,677 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 53 transitions, 153 flow [2023-08-04 04:18:42,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 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 04:18:42,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:18:42,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:18:42,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 04:18:42,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:18:42,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:18:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash 231986241, now seen corresponding path program 1 times [2023-08-04 04:18:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:18:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618599035] [2023-08-04 04:18:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:18:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:18:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:18:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:18:43,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:18:43,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618599035] [2023-08-04 04:18:43,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618599035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:18:43,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:18:43,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-04 04:18:43,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873496825] [2023-08-04 04:18:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:18:43,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 04:18:43,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:18:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 04:18:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-04 04:18:45,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 313 [2023-08-04 04:18:45,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 53 transitions, 153 flow. Second operand has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 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 04:18:45,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:18:45,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 313 [2023-08-04 04:18:45,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:18:50,049 INFO L124 PetriNetUnfolderBase]: 3842/5737 cut-off events. [2023-08-04 04:18:50,049 INFO L125 PetriNetUnfolderBase]: For 1399/1399 co-relation queries the response was YES. [2023-08-04 04:18:50,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13052 conditions, 5737 events. 3842/5737 cut-off events. For 1399/1399 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 32798 event pairs, 505 based on Foata normal form. 68/4726 useless extension candidates. Maximal degree in co-relation 13044. Up to 3058 conditions per place. [2023-08-04 04:18:50,085 INFO L140 encePairwiseOnDemand]: 295/313 looper letters, 207 selfloop transitions, 56 changer transitions 10/275 dead transitions. [2023-08-04 04:18:50,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 275 transitions, 1268 flow [2023-08-04 04:18:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-04 04:18:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-04 04:18:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2162 transitions. [2023-08-04 04:18:50,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4604898828541001 [2023-08-04 04:18:50,091 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2162 transitions. [2023-08-04 04:18:50,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2162 transitions. [2023-08-04 04:18:50,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:18:50,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2162 transitions. [2023-08-04 04:18:50,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 144.13333333333333) internal successors, (2162), 15 states have internal predecessors, (2162), 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 04:18:50,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 313.0) internal successors, (5008), 16 states have internal predecessors, (5008), 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 04:18:50,104 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 313.0) internal successors, (5008), 16 states have internal predecessors, (5008), 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 04:18:50,104 INFO L175 Difference]: Start difference. First operand has 49 places, 53 transitions, 153 flow. Second operand 15 states and 2162 transitions. [2023-08-04 04:18:50,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 275 transitions, 1268 flow [2023-08-04 04:18:50,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 275 transitions, 1268 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:18:50,114 INFO L231 Difference]: Finished difference. Result has 71 places, 117 transitions, 585 flow [2023-08-04 04:18:50,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=585, PETRI_PLACES=71, PETRI_TRANSITIONS=117} [2023-08-04 04:18:50,115 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-08-04 04:18:50,115 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 117 transitions, 585 flow [2023-08-04 04:18:50,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 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 04:18:50,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:18:50,116 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:18:50,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 04:18:50,116 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:18:50,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:18:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1302269091, now seen corresponding path program 1 times [2023-08-04 04:18:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:18:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642003504] [2023-08-04 04:18:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:18:50,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:18:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:18:51,258 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 04:18:51,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:18:51,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642003504] [2023-08-04 04:18:51,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642003504] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:18:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454821203] [2023-08-04 04:18:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:18:51,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:18:51,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:18:51,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:18:51,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 04:18:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:18:51,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 72 conjunts are in the unsatisfiable core [2023-08-04 04:18:51,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:18:51,596 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-04 04:18:51,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-04 04:18:51,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:18:52,110 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-04 04:18:52,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 04:18:52,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:18:53,074 INFO L322 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-08-04 04:18:53,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 120 [2023-08-04 04:18:53,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-04 04:18:53,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-04 04:18:53,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-04 04:18:53,386 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-04 04:18:53,963 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-04 04:18:53,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2023-08-04 04:18:54,124 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 04:18:54,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:18:54,862 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296))) (let ((.cse2 (= .cse0 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_ArrVal_423 |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) .cse2) (or (not .cse2) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_430 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_422) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_424) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_426) |c_~#value~0.base| v_ArrVal_428) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430))) (or (< .cse0 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))))))) is different from false [2023-08-04 04:18:54,922 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_430 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_422) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_424) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse1))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_426) |c_~#value~0.base| v_ArrVal_428) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< (mod .cse1 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) is different from false [2023-08-04 04:18:57,484 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 04:18:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454821203] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:18:57,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:18:57,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-08-04 04:18:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019760820] [2023-08-04 04:18:57,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:18:57,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 04:18:57,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:18:57,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 04:18:57,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=263, Unknown=9, NotChecked=70, Total=420 [2023-08-04 04:18:57,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 313 [2023-08-04 04:18:57,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 117 transitions, 585 flow. Second operand has 21 states, 21 states have (on average 103.42857142857143) internal successors, (2172), 21 states have internal predecessors, (2172), 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 04:18:57,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:18:57,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 313 [2023-08-04 04:18:57,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:19:06,416 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:19:11,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:16,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:19,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:21,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:25,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:27,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:29,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:31,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:33,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:35,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:40,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:42,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:45,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:47,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:54,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:19:56,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:03,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:05,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:07,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:15,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:17,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:19,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:24,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:26,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:29,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:31,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:33,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-04 04:20:45,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:47,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:50,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:52,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:20:59,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:03,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:05,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:07,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:10,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:13,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:15,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:18,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:20,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:21,938 INFO L124 PetriNetUnfolderBase]: 5194/8090 cut-off events. [2023-08-04 04:21:21,938 INFO L125 PetriNetUnfolderBase]: For 7650/7650 co-relation queries the response was YES. [2023-08-04 04:21:21,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24133 conditions, 8090 events. 5194/8090 cut-off events. For 7650/7650 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 51974 event pairs, 564 based on Foata normal form. 232/7571 useless extension candidates. Maximal degree in co-relation 24116. Up to 3837 conditions per place. [2023-08-04 04:21:21,985 INFO L140 encePairwiseOnDemand]: 279/313 looper letters, 382 selfloop transitions, 257 changer transitions 55/696 dead transitions. [2023-08-04 04:21:21,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 696 transitions, 4205 flow [2023-08-04 04:21:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-04 04:21:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-04 04:21:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4831 transitions. [2023-08-04 04:21:21,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.376451336398348 [2023-08-04 04:21:21,999 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 4831 transitions. [2023-08-04 04:21:21,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 4831 transitions. [2023-08-04 04:21:22,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:21:22,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 4831 transitions. [2023-08-04 04:21:22,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 117.82926829268293) internal successors, (4831), 41 states have internal predecessors, (4831), 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 04:21:22,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 313.0) internal successors, (13146), 42 states have internal predecessors, (13146), 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 04:21:22,033 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 313.0) internal successors, (13146), 42 states have internal predecessors, (13146), 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 04:21:22,033 INFO L175 Difference]: Start difference. First operand has 71 places, 117 transitions, 585 flow. Second operand 41 states and 4831 transitions. [2023-08-04 04:21:22,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 696 transitions, 4205 flow [2023-08-04 04:21:22,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 696 transitions, 4161 flow, removed 22 selfloop flow, removed 0 redundant places. [2023-08-04 04:21:22,099 INFO L231 Difference]: Finished difference. Result has 144 places, 354 transitions, 3059 flow [2023-08-04 04:21:22,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=3059, PETRI_PLACES=144, PETRI_TRANSITIONS=354} [2023-08-04 04:21:22,100 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places. [2023-08-04 04:21:22,100 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 354 transitions, 3059 flow [2023-08-04 04:21:22,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 103.42857142857143) internal successors, (2172), 21 states have internal predecessors, (2172), 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 04:21:22,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:21:22,102 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:21:22,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 04:21:22,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:21:22,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:21:22,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:21:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1033619375, now seen corresponding path program 1 times [2023-08-04 04:21:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:21:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974196890] [2023-08-04 04:21:22,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:21:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:21:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:21:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:21:23,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:21:23,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974196890] [2023-08-04 04:21:23,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974196890] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:21:23,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148532588] [2023-08-04 04:21:23,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:21:23,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:21:23,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:21:23,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:21:23,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 04:21:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:21:23,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-04 04:21:23,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:21:23,700 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-04 04:21:23,700 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-04 04:21:24,414 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:21:25,248 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:21:26,097 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-04 04:21:26,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 04:21:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:21:27,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:21:27,667 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of2ForFork0_dec_~dec__v~0#1| 4294967296))) (or (= .cse0 0) (let ((.cse1 (= .cse0 (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_ArrVal_489 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base| v_ArrVal_489) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0))) .cse1) (or (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (< |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| |c_~#dec_flag~0.base|) (not (= (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_486) |c_~#value~0.base| v_ArrVal_488) |c_thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base| v_ArrVal_487) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)))) (not .cse1)))))) is different from false [2023-08-04 04:21:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:21:29,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148532588] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:21:29,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:21:29,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-04 04:21:29,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142443180] [2023-08-04 04:21:29,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:21:29,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-04 04:21:29,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:21:29,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-04 04:21:29,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=134, Unknown=2, NotChecked=24, Total=210 [2023-08-04 04:21:30,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 313 [2023-08-04 04:21:30,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 354 transitions, 3059 flow. Second operand has 15 states, 15 states have (on average 104.33333333333333) internal successors, (1565), 15 states have internal predecessors, (1565), 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 04:21:30,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:21:30,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 313 [2023-08-04 04:21:30,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:21:42,284 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0))) (and (or .cse0 (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (|v_thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base_65| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (< |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| |c_~#dec_flag~0.base|) (not (= (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_486) |c_~#value~0.base| v_ArrVal_488) |v_thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base_65| v_ArrVal_487) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)) (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base_65|) 0))))) (= |c_thr1Thread2of2ForFork0_dec_~dec__v~0#1| 0) (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (|v_thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base_65| Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_485))) (or (< |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| |c_~#dec_flag~0.base|) (not (= (select |c_#valid| |v_thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base_65|) 0)) (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 0) (not (= (mod (select (select (store (store (store .cse1 |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_486) |c_~#value~0.base| v_ArrVal_488) |v_thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base_65| v_ArrVal_487) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0))))) (or (forall ((|v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (or (< |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| |c_~#dec_flag~0.base|) (not (= (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_486) |c_~#value~0.base| v_ArrVal_488) |c_thr1Thread2of2ForFork0_dec_~#dec__casret~0#1.base| v_ArrVal_487) |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset|) 4294967296) 0)))) .cse0))) is different from false [2023-08-04 04:21:47,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:53,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:21:55,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:22:04,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:22:17,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:22:19,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:22:22,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:22:24,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:22:31,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:22:38,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:22:41,363 INFO L124 PetriNetUnfolderBase]: 6954/10872 cut-off events. [2023-08-04 04:22:41,363 INFO L125 PetriNetUnfolderBase]: For 95668/95668 co-relation queries the response was YES. [2023-08-04 04:22:41,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57696 conditions, 10872 events. 6954/10872 cut-off events. For 95668/95668 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 73646 event pairs, 672 based on Foata normal form. 50/10451 useless extension candidates. Maximal degree in co-relation 57646. Up to 6871 conditions per place. [2023-08-04 04:22:41,442 INFO L140 encePairwiseOnDemand]: 287/313 looper letters, 520 selfloop transitions, 354 changer transitions 161/1037 dead transitions. [2023-08-04 04:22:41,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 1037 transitions, 11282 flow [2023-08-04 04:22:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-04 04:22:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-04 04:22:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 4439 transitions. [2023-08-04 04:22:41,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36364381092815595 [2023-08-04 04:22:41,452 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 4439 transitions. [2023-08-04 04:22:41,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 4439 transitions. [2023-08-04 04:22:41,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:22:41,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 4439 transitions. [2023-08-04 04:22:41,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 113.82051282051282) internal successors, (4439), 39 states have internal predecessors, (4439), 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 04:22:41,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 313.0) internal successors, (12520), 40 states have internal predecessors, (12520), 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 04:22:41,492 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 313.0) internal successors, (12520), 40 states have internal predecessors, (12520), 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 04:22:41,492 INFO L175 Difference]: Start difference. First operand has 144 places, 354 transitions, 3059 flow. Second operand 39 states and 4439 transitions. [2023-08-04 04:22:41,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 1037 transitions, 11282 flow [2023-08-04 04:22:42,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 1037 transitions, 10627 flow, removed 291 selfloop flow, removed 6 redundant places. [2023-08-04 04:22:42,024 INFO L231 Difference]: Finished difference. Result has 190 places, 641 transitions, 6511 flow [2023-08-04 04:22:42,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=2566, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=6511, PETRI_PLACES=190, PETRI_TRANSITIONS=641} [2023-08-04 04:22:42,025 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places. [2023-08-04 04:22:42,025 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 641 transitions, 6511 flow [2023-08-04 04:22:42,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 104.33333333333333) internal successors, (1565), 15 states have internal predecessors, (1565), 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 04:22:42,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:22:42,026 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:22:42,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 04:22:42,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-04 04:22:42,226 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:22:42,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:22:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash -307702875, now seen corresponding path program 1 times [2023-08-04 04:22:42,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:22:42,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462925049] [2023-08-04 04:22:42,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:22:42,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:22:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:22:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:22:44,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:22:44,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462925049] [2023-08-04 04:22:44,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462925049] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:22:44,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707385722] [2023-08-04 04:22:44,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:22:44,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:22:44,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:22:44,109 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 04:22:44,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 04:22:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:22:44,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-04 04:22:44,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:22:44,745 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-04 04:22:44,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-04 04:22:45,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:22:46,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-08-04 04:22:47,139 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-04 04:22:47,139 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 04:22:48,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:22:48,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:22:49,426 INFO L322 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-08-04 04:22:49,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 383 [2023-08-04 04:22:49,503 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-04 04:22:49,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-04 04:22:49,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-04 04:22:49,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-04 04:22:50,040 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:22:50,041 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:22:50,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:22:50,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:22:50,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:22:50,280 INFO L217 Elim1Store]: Index analysis took 268 ms [2023-08-04 04:22:50,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 220 [2023-08-04 04:22:50,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:22:51,035 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:22:51,208 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:22:51,251 INFO L217 Elim1Store]: Index analysis took 622 ms [2023-08-04 04:22:51,635 INFO L322 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2023-08-04 04:22:51,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 154 treesize of output 252 [2023-08-04 04:22:52,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 04:22:52,298 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 04:22:52,318 INFO L217 Elim1Store]: Index analysis took 290 ms [2023-08-04 04:22:52,612 INFO L322 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-08-04 04:22:52,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 136 treesize of output 128 [2023-08-04 04:22:53,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 120 [2023-08-04 04:22:53,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 26 [2023-08-04 04:22:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:22:55,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:22:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:22:59,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707385722] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:22:59,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:22:59,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-04 04:22:59,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962125549] [2023-08-04 04:22:59,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:22:59,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-04 04:22:59,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:22:59,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-04 04:22:59,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=303, Unknown=2, NotChecked=0, Total=380 [2023-08-04 04:23:03,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:23:15,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 313 [2023-08-04 04:23:15,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 641 transitions, 6511 flow. Second operand has 20 states, 20 states have (on average 101.65) internal successors, (2033), 20 states have internal predecessors, (2033), 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 04:23:15,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:15,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 313 [2023-08-04 04:23:15,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:25,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:23:27,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:23:32,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:23:35,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:23:38,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:23:40,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:23:43,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:23:52,285 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:23:54,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:23:56,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:30,374 WARN L233 SmtUtils]: Spent 12.88s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:24:33,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:35,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:40,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:42,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:44,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:47,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:49,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:51,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:25:10,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:25:13,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:25:15,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:25:31,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:25:57,588 WARN L233 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:26:12,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:26:15,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:26:17,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:26:19,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:26:21,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:26:34,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:27:03,479 WARN L233 SmtUtils]: Spent 15.36s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:27:17,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:27:19,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:27:44,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:27:53,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:27:55,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:27:57,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:06,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:09,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:12,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:21,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:25,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:27,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:29,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:31,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:33,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:36,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:38,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:52,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:55,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:58,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:01,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:03,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:05,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:07,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:10,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:43,450 WARN L233 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:29:45,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:48,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:50,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:52,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:08,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:10,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:13,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:18,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:20,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:22,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:26,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:29,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:32,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:34,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:37,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:39,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:41,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:43,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:47,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:49,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:51,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:54,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:56,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:30:59,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:31:01,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:31:04,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:31:08,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:31:10,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:31:12,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:31:15,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:31:17,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:31:18,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:31:20,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-04 04:31:26,669 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 04:31:26,669 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 04:31:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-08-04 04:31:27,056 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-04 04:31:27,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 04:31:27,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:31:27,257 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. [2023-08-04 04:31:27,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-04 04:31:27,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-04 04:31:27,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-08-04 04:31:27,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-08-04 04:31:27,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-04 04:31:27,257 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-04 04:31:27,258 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-04 04:31:27,258 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 04:31:27,258 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 04:31:27,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 04:31:27 BasicIcfg [2023-08-04 04:31:27,261 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 04:31:27,261 INFO L158 Benchmark]: Toolchain (without parser) took 849091.81ms. Allocated memory was 350.2MB in the beginning and 620.8MB in the end (delta: 270.5MB). Free memory was 297.1MB in the beginning and 263.6MB in the end (delta: 33.6MB). Peak memory consumption was 306.9MB. Max. memory is 16.0GB. [2023-08-04 04:31:27,261 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 350.2MB. Free memory is still 298.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 04:31:27,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.76ms. Allocated memory is still 350.2MB. Free memory was 297.1MB in the beginning and 276.3MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-04 04:31:27,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.70ms. Allocated memory is still 350.2MB. Free memory was 276.3MB in the beginning and 274.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:31:27,262 INFO L158 Benchmark]: Boogie Preprocessor took 32.07ms. Allocated memory is still 350.2MB. Free memory was 274.3MB in the beginning and 272.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 04:31:27,262 INFO L158 Benchmark]: RCFGBuilder took 655.23ms. Allocated memory is still 350.2MB. Free memory was 272.2MB in the beginning and 235.2MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-04 04:31:27,262 INFO L158 Benchmark]: TraceAbstraction took 847944.01ms. Allocated memory was 350.2MB in the beginning and 620.8MB in the end (delta: 270.5MB). Free memory was 234.4MB in the beginning and 263.6MB in the end (delta: -29.1MB). Peak memory consumption was 244.0MB. Max. memory is 16.0GB. [2023-08-04 04:31:27,263 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 350.2MB. Free memory is still 298.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 414.76ms. Allocated memory is still 350.2MB. Free memory was 297.1MB in the beginning and 276.3MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.70ms. Allocated memory is still 350.2MB. Free memory was 276.3MB in the beginning and 274.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.07ms. Allocated memory is still 350.2MB. Free memory was 274.3MB in the beginning and 272.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 655.23ms. Allocated memory is still 350.2MB. Free memory was 272.2MB in the beginning and 235.2MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 847944.01ms. Allocated memory was 350.2MB in the beginning and 620.8MB in the end (delta: 270.5MB). Free memory was 234.4MB in the beginning and 263.6MB in the end (delta: -29.1MB). Peak memory consumption was 244.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 686]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [686] - GenericResultAtLocation [Line: 687]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [687] - GenericResultAtLocation [Line: 688]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [688] - GenericResultAtLocation [Line: 689]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [689] - GenericResultAtLocation [Line: 690]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [690] - GenericResultAtLocation [Line: 701]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [701] - GenericResultAtLocation [Line: 702]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [702] - GenericResultAtLocation [Line: 703]: Unsoundness Warning unspecified type, defaulting to int C: volatile unsigned [703] - GenericResultAtLocation [Line: 704]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [704] - GenericResultAtLocation [Line: 708]: Unsoundness Warning unspecified type, defaulting to int C: inline unsigned [708] - GenericResultAtLocation [Line: 709]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [709] - GenericResultAtLocation [Line: 722]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [722] - GenericResultAtLocation [Line: 726]: Unsoundness Warning unspecified type, defaulting to int C: inline unsigned [726] - GenericResultAtLocation [Line: 727]: Unsoundness Warning unspecified type, defaulting to int C: unsigned [727] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 97 PlacesBefore, 23 PlacesAfterwards, 102 TransitionsBefore, 27 TransitionsAfterwards, 2080 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 2550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1923, independent: 1811, independent conditional: 0, independent unconditional: 1811, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1167, independent: 1123, independent conditional: 0, independent unconditional: 1123, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1923, independent: 688, independent conditional: 0, independent unconditional: 688, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 1167, unknown conditional: 0, unknown unconditional: 1167] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.0s, 97 PlacesBefore, 23 PlacesAfterwards, 102 TransitionsBefore, 27 TransitionsAfterwards, 2080 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 2539 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1851, independent: 1739, independent conditional: 0, independent unconditional: 1739, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1144, independent: 1099, independent conditional: 0, independent unconditional: 1099, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1851, independent: 640, independent conditional: 0, independent unconditional: 640, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 1144, unknown conditional: 0, unknown unconditional: 1144] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.9s, 158 PlacesBefore, 43 PlacesAfterwards, 168 TransitionsBefore, 52 TransitionsAfterwards, 12740 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 103 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 22 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 18472 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11189, independent: 10962, independent conditional: 0, independent unconditional: 10962, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6937, independent: 6864, independent conditional: 0, independent unconditional: 6864, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11189, independent: 4098, independent conditional: 0, independent unconditional: 4098, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 6937, unknown conditional: 0, unknown unconditional: 6937] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 317, Positive conditional cache size: 0, Positive unconditional cache size: 317, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 706]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 724]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 154 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 335 mSDsluCounter, 374 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 122 IncrementalHoareTripleChecker+Unchecked, 303 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1195 IncrementalHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 71 mSDtfsCounter, 1195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=4, InterpolantAutomatonStates: 37, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 112 ConstructedInterpolants, 9 QuantifiedInterpolants, 2003 SizeOfPredicates, 31 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 24/35 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 4 procedures, 213 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: 794.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 733.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.9s, HoareTripleCheckerStatistics: 620 mSolverCounterUnknown, 2349 SdHoareTripleChecker+Valid, 420.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2233 mSDsluCounter, 799 SdHoareTripleChecker+Invalid, 404.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1946 IncrementalHoareTripleChecker+Unchecked, 739 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8127 IncrementalHoareTripleChecker+Invalid, 11031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 60 mSDtfsCounter, 8127 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 150 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 317.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6511occurred in iteration=5, InterpolantAutomatonStates: 101, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 118 ConstructedInterpolants, 29 QuantifiedInterpolants, 4426 SizeOfPredicates, 40 NumberOfNonLiveVariables, 582 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 6/15 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 3 procedures, 154 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.0s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 0, 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, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown