/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 TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 15:23:25,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 15:23:25,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 15:23:25,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 15:23:25,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 15:23:25,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 15:23:25,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 15:23:25,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 15:23:25,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 15:23:25,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 15:23:25,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 15:23:25,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 15:23:25,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 15:23:25,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 15:23:25,579 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 15:23:25,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 15:23:25,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 15:23:25,579 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 15:23:25,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 15:23:25,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 15:23:25,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 15:23:25,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 15:23:25,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 15:23:25,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 15:23:25,581 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 15:23:25,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 15:23:25,581 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 15:23:25,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 15:23:25,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 15:23:25,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 15:23:25,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:23:25,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 15:23:25,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 15:23:25,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 15:23:25,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 15:23:25,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 15:23:25,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 15:23:25,584 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 15:23:25,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 15:23:25,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 15:23:25,584 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 15:23:25,584 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 -> TOGETHER [2023-08-03 15:23:25,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 15:23:25,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 15:23:25,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 15:23:25,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 15:23:25,815 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 15:23:25,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i [2023-08-03 15:23:26,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 15:23:26,988 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 15:23:26,988 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i [2023-08-03 15:23:27,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78ea9272/f3f07ce07c184935a70102ab36b8ee36/FLAGc93ff26ea [2023-08-03 15:23:27,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78ea9272/f3f07ce07c184935a70102ab36b8ee36 [2023-08-03 15:23:27,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 15:23:27,027 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 15:23:27,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 15:23:27,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 15:23:27,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 15:23:27,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d98f927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27, skipping insertion in model container [2023-08-03 15:23:27,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,069 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 15:23:27,374 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/goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i[41323,41336] [2023-08-03 15:23:27,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:23:27,419 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 15:23:27,429 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 15:23:27,430 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 15:23:27,436 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-03 15:23:27,441 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/goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i[41323,41336] [2023-08-03 15:23:27,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:23:27,480 INFO L206 MainTranslator]: Completed translation [2023-08-03 15:23:27,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27 WrapperNode [2023-08-03 15:23:27,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 15:23:27,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 15:23:27,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 15:23:27,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 15:23:27,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,519 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 193 [2023-08-03 15:23:27,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 15:23:27,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 15:23:27,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 15:23:27,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 15:23:27,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 15:23:27,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 15:23:27,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 15:23:27,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 15:23:27,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (1/1) ... [2023-08-03 15:23:27,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:23:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:27,578 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-03 15:23:27,580 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-03 15:23:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 15:23:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 15:23:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 15:23:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 15:23:27,602 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-03 15:23:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 15:23:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-03 15:23:27,603 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-03 15:23:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 15:23:27,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 15:23:27,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 15:23:27,604 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 15:23:27,697 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 15:23:27,699 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 15:23:27,919 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 15:23:27,925 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 15:23:27,925 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-03 15:23:27,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:23:27 BoogieIcfgContainer [2023-08-03 15:23:27,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 15:23:27,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 15:23:27,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 15:23:27,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 15:23:27,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 03:23:27" (1/3) ... [2023-08-03 15:23:27,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337fd5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:23:27, skipping insertion in model container [2023-08-03 15:23:27,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:23:27" (2/3) ... [2023-08-03 15:23:27,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337fd5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:23:27, skipping insertion in model container [2023-08-03 15:23:27,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:23:27" (3/3) ... [2023-08-03 15:23:27,932 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_77-tricky_address4_racing_bound2.i [2023-08-03 15:23:27,938 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 15:23:27,944 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 15:23:27,944 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 15:23:27,944 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 15:23:27,993 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-03 15:23:28,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-03 15:23:28,078 INFO L124 PetriNetUnfolderBase]: 45/263 cut-off events. [2023-08-03 15:23:28,078 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-03 15:23:28,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 263 events. 45/263 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 814 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-03 15:23:28,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-03 15:23:28,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-03 15:23:28,090 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:23:28,096 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-03 15:23:28,098 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-03 15:23:28,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-03 15:23:28,130 INFO L124 PetriNetUnfolderBase]: 44/258 cut-off events. [2023-08-03 15:23:28,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:23:28,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 258 events. 44/258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 778 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-08-03 15:23:28,136 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-08-03 15:23:30,280 INFO L134 LiptonReduction]: Checked pairs total: 17790 [2023-08-03 15:23:30,280 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-08-03 15:23:30,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:23:30,293 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;@1345f458, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:23:30,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 15:23:30,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:23:30,296 INFO L124 PetriNetUnfolderBase]: 4/19 cut-off events. [2023-08-03 15:23:30,297 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:23:30,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:30,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 15:23:30,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:23:30,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:30,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1355205613, now seen corresponding path program 1 times [2023-08-03 15:23:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792372753] [2023-08-03 15:23:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:30,454 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-03 15:23:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792372753] [2023-08-03 15:23:30,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792372753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:23:30,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:23:30,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:23:30,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659396463] [2023-08-03 15:23:30,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:23:30,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:23:30,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:30,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:23:30,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:23:30,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-03 15:23:30,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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-03 15:23:30,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:30,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-03 15:23:30,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:30,616 INFO L124 PetriNetUnfolderBase]: 272/614 cut-off events. [2023-08-03 15:23:30,616 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:23:30,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 614 events. 272/614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3057 event pairs, 238 based on Foata normal form. 118/640 useless extension candidates. Maximal degree in co-relation 1094. Up to 528 conditions per place. [2023-08-03 15:23:30,620 INFO L140 encePairwiseOnDemand]: 332/357 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-03 15:23:30,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-03 15:23:30,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:23:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:23:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2023-08-03 15:23:30,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976657329598506 [2023-08-03 15:23:30,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2023-08-03 15:23:30,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2023-08-03 15:23:30,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:30,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2023-08-03 15:23:30,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-03 15:23:30,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 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-03 15:23:30,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 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-03 15:23:30,646 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 533 transitions. [2023-08-03 15:23:30,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-03 15:23:30,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:23:30,650 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 105 flow [2023-08-03 15:23:30,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-03 15:23:30,669 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-03 15:23:30,669 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 105 flow [2023-08-03 15:23:30,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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-03 15:23:30,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:30,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:23:30,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 15:23:30,670 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:23:30,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1202044733, now seen corresponding path program 1 times [2023-08-03 15:23:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305703951] [2023-08-03 15:23:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:30,742 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-03 15:23:30,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:30,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305703951] [2023-08-03 15:23:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305703951] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:30,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766021117] [2023-08-03 15:23:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:30,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:30,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:30,745 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-03 15:23:30,746 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-03 15:23:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:30,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 15:23:30,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:23:30,812 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:23:30,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766021117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:23:30,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:23:30,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 15:23:30,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24376885] [2023-08-03 15:23:30,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:23:30,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:23:30,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:30,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:23:30,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:23:30,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-03 15:23:30,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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-03 15:23:30,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:30,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-03 15:23:30,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:30,897 INFO L124 PetriNetUnfolderBase]: 255/592 cut-off events. [2023-08-03 15:23:30,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:23:30,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 592 events. 255/592 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3266 event pairs, 0 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 1120. Up to 497 conditions per place. [2023-08-03 15:23:30,900 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 49 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-03 15:23:30,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 237 flow [2023-08-03 15:23:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:23:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:23:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-03 15:23:30,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-08-03 15:23:30,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-03 15:23:30,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-03 15:23:30,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:30,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-03 15:23:30,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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-03 15:23:30,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 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-03 15:23:30,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 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-03 15:23:30,906 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 105 flow. Second operand 3 states and 525 transitions. [2023-08-03 15:23:30,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 237 flow [2023-08-03 15:23:30,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 233 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 15:23:30,908 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 109 flow [2023-08-03 15:23:30,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-03 15:23:30,908 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2023-08-03 15:23:30,908 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 109 flow [2023-08-03 15:23:30,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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-03 15:23:30,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:30,909 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-03 15:23:30,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 15:23:31,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:31,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:23:31,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1382333179, now seen corresponding path program 1 times [2023-08-03 15:23:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723683218] [2023-08-03 15:23:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:23:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723683218] [2023-08-03 15:23:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723683218] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:31,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171147082] [2023-08-03 15:23:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:31,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:31,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:31,219 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-03 15:23:31,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 15:23:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:31,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 15:23:31,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:23:31,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:23:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:23:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171147082] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:23:31,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:23:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 15:23:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580274325] [2023-08-03 15:23:31,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:23:31,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 15:23:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:31,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 15:23:31,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 15:23:31,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 357 [2023-08-03 15:23:31,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 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-03 15:23:31,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:31,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 357 [2023-08-03 15:23:31,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:31,399 INFO L124 PetriNetUnfolderBase]: 271/599 cut-off events. [2023-08-03 15:23:31,399 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-03 15:23:31,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 599 events. 271/599 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2938 event pairs, 238 based on Foata normal form. 3/529 useless extension candidates. Maximal degree in co-relation 1149. Up to 513 conditions per place. [2023-08-03 15:23:31,401 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 34 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-03 15:23:31,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 199 flow [2023-08-03 15:23:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:23:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:23:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2023-08-03 15:23:31,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45938375350140054 [2023-08-03 15:23:31,404 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 984 transitions. [2023-08-03 15:23:31,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 984 transitions. [2023-08-03 15:23:31,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:31,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 984 transitions. [2023-08-03 15:23:31,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 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-03 15:23:31,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 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-03 15:23:31,409 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 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-03 15:23:31,409 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 109 flow. Second operand 6 states and 984 transitions. [2023-08-03 15:23:31,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 199 flow [2023-08-03 15:23:31,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 15:23:31,411 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 141 flow [2023-08-03 15:23:31,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-03 15:23:31,412 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2023-08-03 15:23:31,412 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 141 flow [2023-08-03 15:23:31,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 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-03 15:23:31,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:31,412 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-03 15:23:31,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 15:23:31,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-03 15:23:31,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:23:31,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:31,617 INFO L85 PathProgramCache]: Analyzing trace with hash 941146001, now seen corresponding path program 2 times [2023-08-03 15:23:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:31,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298070408] [2023-08-03 15:23:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:31,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:23:31,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298070408] [2023-08-03 15:23:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298070408] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85170587] [2023-08-03 15:23:31,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:23:31,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:31,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:31,740 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-03 15:23:31,766 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-03 15:23:31,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:23:31,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:23:31,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 15:23:31,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:23:31,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:23:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:23:31,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85170587] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:23:31,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:23:31,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 15:23:31,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857899867] [2023-08-03 15:23:31,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:23:31,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 15:23:31,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:31,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 15:23:31,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 15:23:31,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 357 [2023-08-03 15:23:31,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 141 flow. Second operand has 13 states, 13 states have (on average 158.30769230769232) internal successors, (2058), 13 states have internal predecessors, (2058), 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-03 15:23:31,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:31,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 357 [2023-08-03 15:23:31,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:32,013 INFO L124 PetriNetUnfolderBase]: 270/602 cut-off events. [2023-08-03 15:23:32,013 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-08-03 15:23:32,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 602 events. 270/602 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2934 event pairs, 238 based on Foata normal form. 6/536 useless extension candidates. Maximal degree in co-relation 1138. Up to 513 conditions per place. [2023-08-03 15:23:32,015 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 34 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2023-08-03 15:23:32,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 267 flow [2023-08-03 15:23:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 15:23:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 15:23:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1935 transitions. [2023-08-03 15:23:32,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45168067226890757 [2023-08-03 15:23:32,020 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1935 transitions. [2023-08-03 15:23:32,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1935 transitions. [2023-08-03 15:23:32,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:32,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1935 transitions. [2023-08-03 15:23:32,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 161.25) internal successors, (1935), 12 states have internal predecessors, (1935), 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-03 15:23:32,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 357.0) internal successors, (4641), 13 states have internal predecessors, (4641), 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-03 15:23:32,030 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 357.0) internal successors, (4641), 13 states have internal predecessors, (4641), 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-03 15:23:32,030 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 141 flow. Second operand 12 states and 1935 transitions. [2023-08-03 15:23:32,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 267 flow [2023-08-03 15:23:32,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 54 transitions, 253 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 15:23:32,032 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 211 flow [2023-08-03 15:23:32,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=211, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2023-08-03 15:23:32,033 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2023-08-03 15:23:32,033 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 211 flow [2023-08-03 15:23:32,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 158.30769230769232) internal successors, (2058), 13 states have internal predecessors, (2058), 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-03 15:23:32,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:32,034 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-03 15:23:32,043 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-03 15:23:32,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:32,239 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:23:32,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:32,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1854023505, now seen corresponding path program 3 times [2023-08-03 15:23:32,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:32,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787168464] [2023-08-03 15:23:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:32,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:23:32,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 15:23:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:23:32,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 15:23:32,306 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 15:23:32,307 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-08-03 15:23:32,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 15:23:32,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 15:23:32,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 15:23:32,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 15:23:32,308 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-08-03 15:23:32,310 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 15:23:32,310 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 15:23:32,350 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-03 15:23:32,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 15:23:32,398 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-03 15:23:32,398 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 15:23:32,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 430 events. 75/430 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1680 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 265. Up to 12 conditions per place. [2023-08-03 15:23:32,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 15:23:32,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 266 transitions, 550 flow [2023-08-03 15:23:32,427 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:23:32,427 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-03 15:23:32,428 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-03 15:23:32,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-03 15:23:32,453 INFO L124 PetriNetUnfolderBase]: 75/430 cut-off events. [2023-08-03 15:23:32,453 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 15:23:32,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 430 events. 75/430 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1680 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 265. Up to 12 conditions per place. [2023-08-03 15:23:32,466 INFO L119 LiptonReduction]: Number of co-enabled transitions 33228 [2023-08-03 15:23:34,911 INFO L134 LiptonReduction]: Checked pairs total: 56804 [2023-08-03 15:23:34,912 INFO L136 LiptonReduction]: Total number of compositions: 219 [2023-08-03 15:23:34,913 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:23:34,913 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;@1345f458, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:23:34,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 15:23:34,915 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:23:34,916 INFO L124 PetriNetUnfolderBase]: 8/30 cut-off events. [2023-08-03 15:23:34,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:23:34,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:34,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 15:23:34,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:23:34,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:34,916 INFO L85 PathProgramCache]: Analyzing trace with hash 685324257, now seen corresponding path program 1 times [2023-08-03 15:23:34,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:34,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992094348] [2023-08-03 15:23:34,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:34,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:34,932 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-03 15:23:34,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992094348] [2023-08-03 15:23:34,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992094348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:23:34,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:23:34,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:23:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259103397] [2023-08-03 15:23:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:23:34,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:23:34,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:34,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:23:34,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:23:34,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 485 [2023-08-03 15:23:34,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 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-03 15:23:34,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:34,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 485 [2023-08-03 15:23:34,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:35,815 INFO L124 PetriNetUnfolderBase]: 10559/16533 cut-off events. [2023-08-03 15:23:35,815 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-08-03 15:23:35,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32068 conditions, 16533 events. 10559/16533 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 109159 event pairs, 9818 based on Foata normal form. 2499/16469 useless extension candidates. Maximal degree in co-relation 13984. Up to 15431 conditions per place. [2023-08-03 15:23:35,873 INFO L140 encePairwiseOnDemand]: 450/485 looper letters, 56 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-03 15:23:35,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2023-08-03 15:23:35,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:23:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:23:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2023-08-03 15:23:35,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079037800687285 [2023-08-03 15:23:35,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 739 transitions. [2023-08-03 15:23:35,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 739 transitions. [2023-08-03 15:23:35,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:35,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 739 transitions. [2023-08-03 15:23:35,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 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-03 15:23:35,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 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-03 15:23:35,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 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-03 15:23:35,879 INFO L175 Difference]: Start difference. First operand has 68 places, 101 transitions, 220 flow. Second operand 3 states and 739 transitions. [2023-08-03 15:23:35,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2023-08-03 15:23:35,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:23:35,881 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-03 15:23:35,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-08-03 15:23:35,882 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 15:23:35,882 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-03 15:23:35,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 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-03 15:23:35,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:35,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:23:35,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 15:23:35,883 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:23:35,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash -909660943, now seen corresponding path program 1 times [2023-08-03 15:23:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:35,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395666818] [2023-08-03 15:23:35,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:35,905 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-03 15:23:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:35,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395666818] [2023-08-03 15:23:35,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395666818] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:35,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414376304] [2023-08-03 15:23:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:35,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:35,934 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-03 15:23:35,939 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-03 15:23:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:35,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 15:23:35,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:23:35,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:23:35,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414376304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:23:35,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:23:35,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 15:23:35,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109425484] [2023-08-03 15:23:35,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:23:35,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:23:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:23:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:23:36,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 485 [2023-08-03 15:23:36,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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-03 15:23:36,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:36,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 485 [2023-08-03 15:23:36,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:36,854 INFO L124 PetriNetUnfolderBase]: 10416/16508 cut-off events. [2023-08-03 15:23:36,854 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2023-08-03 15:23:36,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32058 conditions, 16508 events. 10416/16508 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 111734 event pairs, 4650 based on Foata normal form. 0/13980 useless extension candidates. Maximal degree in co-relation 32045. Up to 15399 conditions per place. [2023-08-03 15:23:36,907 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 74 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-03 15:23:36,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 356 flow [2023-08-03 15:23:36,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:23:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:23:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2023-08-03 15:23:36,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49759450171821307 [2023-08-03 15:23:36,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2023-08-03 15:23:36,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2023-08-03 15:23:36,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:36,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2023-08-03 15:23:36,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-03 15:23:36,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 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-03 15:23:36,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 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-03 15:23:36,913 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 724 transitions. [2023-08-03 15:23:36,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 356 flow [2023-08-03 15:23:36,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 15:23:36,915 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-03 15:23:36,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-08-03 15:23:36,915 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-03 15:23:36,915 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-03 15:23:36,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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-03 15:23:36,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:36,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:23:36,924 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-03 15:23:37,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:37,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:23:37,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:37,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1710054241, now seen corresponding path program 1 times [2023-08-03 15:23:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:37,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533556036] [2023-08-03 15:23:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:37,165 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-03 15:23:37,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:37,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533556036] [2023-08-03 15:23:37,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533556036] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:37,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172248890] [2023-08-03 15:23:37,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:37,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:37,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:37,167 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-03 15:23:37,192 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-03 15:23:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:37,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 15:23:37,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:37,232 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-03 15:23:37,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:23:37,242 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-03 15:23:37,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172248890] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:23:37,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:23:37,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 15:23:37,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785013044] [2023-08-03 15:23:37,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:23:37,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 15:23:37,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:37,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 15:23:37,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 15:23:37,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 15:23:37,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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-03 15:23:37,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:37,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 15:23:37,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:38,239 INFO L124 PetriNetUnfolderBase]: 10623/16504 cut-off events. [2023-08-03 15:23:38,239 INFO L125 PetriNetUnfolderBase]: For 685/685 co-relation queries the response was YES. [2023-08-03 15:23:38,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32633 conditions, 16504 events. 10623/16504 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 108155 event pairs, 9818 based on Foata normal form. 3/14244 useless extension candidates. Maximal degree in co-relation 32605. Up to 15417 conditions per place. [2023-08-03 15:23:38,277 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 57 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-03 15:23:38,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 312 flow [2023-08-03 15:23:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:23:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:23:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1354 transitions. [2023-08-03 15:23:38,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652920962199313 [2023-08-03 15:23:38,280 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1354 transitions. [2023-08-03 15:23:38,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1354 transitions. [2023-08-03 15:23:38,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:38,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1354 transitions. [2023-08-03 15:23:38,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 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-03 15:23:38,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 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-03 15:23:38,287 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 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-03 15:23:38,287 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1354 transitions. [2023-08-03 15:23:38,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 312 flow [2023-08-03 15:23:38,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:23:38,290 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-03 15:23:38,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-08-03 15:23:38,291 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-03 15:23:38,291 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-03 15:23:38,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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-03 15:23:38,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:38,292 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:23:38,296 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-03 15:23:38,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:38,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:23:38,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1658605999, now seen corresponding path program 2 times [2023-08-03 15:23:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359860141] [2023-08-03 15:23:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:23:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359860141] [2023-08-03 15:23:38,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359860141] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315419085] [2023-08-03 15:23:38,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:23:38,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:38,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:38,582 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-03 15:23:38,585 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-03 15:23:38,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-03 15:23:38,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:23:38,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-03 15:23:38,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:38,667 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 6 [2023-08-03 15:23:38,709 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:23:38,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:23:38,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:23:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-03 15:23:38,774 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:23:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315419085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:23:38,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:23:38,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-03 15:23:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126997470] [2023-08-03 15:23:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:23:38,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 15:23:38,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:38,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 15:23:38,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-03 15:23:38,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 485 [2023-08-03 15:23:38,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 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-03 15:23:38,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:38,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 485 [2023-08-03 15:23:38,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:40,007 INFO L124 PetriNetUnfolderBase]: 10764/16984 cut-off events. [2023-08-03 15:23:40,007 INFO L125 PetriNetUnfolderBase]: For 685/685 co-relation queries the response was YES. [2023-08-03 15:23:40,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33923 conditions, 16984 events. 10764/16984 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 115278 event pairs, 2807 based on Foata normal form. 0/14965 useless extension candidates. Maximal degree in co-relation 33887. Up to 12964 conditions per place. [2023-08-03 15:23:40,051 INFO L140 encePairwiseOnDemand]: 475/485 looper letters, 123 selfloop transitions, 14 changer transitions 14/163 dead transitions. [2023-08-03 15:23:40,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 163 transitions, 721 flow [2023-08-03 15:23:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:23:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:23:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1388 transitions. [2023-08-03 15:23:40,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47697594501718216 [2023-08-03 15:23:40,055 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1388 transitions. [2023-08-03 15:23:40,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1388 transitions. [2023-08-03 15:23:40,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:40,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1388 transitions. [2023-08-03 15:23:40,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 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-03 15:23:40,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 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-03 15:23:40,060 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 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-03 15:23:40,060 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1388 transitions. [2023-08-03 15:23:40,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 163 transitions, 721 flow [2023-08-03 15:23:40,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 163 transitions, 707 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 15:23:40,063 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 293 flow [2023-08-03 15:23:40,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-03 15:23:40,063 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 20 predicate places. [2023-08-03 15:23:40,063 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 293 flow [2023-08-03 15:23:40,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 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-03 15:23:40,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:40,064 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 15:23:40,071 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-03 15:23:40,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:40,269 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:23:40,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -845271688, now seen corresponding path program 1 times [2023-08-03 15:23:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396553304] [2023-08-03 15:23:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 15:23:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396553304] [2023-08-03 15:23:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396553304] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692955441] [2023-08-03 15:23:40,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:40,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:40,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:40,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:23:40,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 15:23:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:40,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 15:23:40,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 15:23:40,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:23:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 15:23:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692955441] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:23:40,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:23:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 15:23:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504824050] [2023-08-03 15:23:40,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:23:40,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 15:23:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:40,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 15:23:40,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 15:23:40,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 15:23:40,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 293 flow. Second operand has 13 states, 13 states have (on average 216.3846153846154) internal successors, (2813), 13 states have internal predecessors, (2813), 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-03 15:23:40,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:40,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 15:23:40,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:41,694 INFO L124 PetriNetUnfolderBase]: 10762/17136 cut-off events. [2023-08-03 15:23:41,694 INFO L125 PetriNetUnfolderBase]: For 5753/5761 co-relation queries the response was YES. [2023-08-03 15:23:41,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38118 conditions, 17136 events. 10762/17136 cut-off events. For 5753/5761 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 117384 event pairs, 9444 based on Foata normal form. 6/16093 useless extension candidates. Maximal degree in co-relation 38059. Up to 16223 conditions per place. [2023-08-03 15:23:41,730 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 69 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-03 15:23:41,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 489 flow [2023-08-03 15:23:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 15:23:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 15:23:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2653 transitions. [2023-08-03 15:23:41,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558419243986254 [2023-08-03 15:23:41,735 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2653 transitions. [2023-08-03 15:23:41,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2653 transitions. [2023-08-03 15:23:41,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:41,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2653 transitions. [2023-08-03 15:23:41,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 221.08333333333334) internal successors, (2653), 12 states have internal predecessors, (2653), 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-03 15:23:41,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 485.0) internal successors, (6305), 13 states have internal predecessors, (6305), 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-03 15:23:41,745 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 485.0) internal successors, (6305), 13 states have internal predecessors, (6305), 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-03 15:23:41,746 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 293 flow. Second operand 12 states and 2653 transitions. [2023-08-03 15:23:41,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 489 flow [2023-08-03 15:23:41,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 92 transitions, 489 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:23:41,758 INFO L231 Difference]: Finished difference. Result has 105 places, 92 transitions, 377 flow [2023-08-03 15:23:41,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=377, PETRI_PLACES=105, PETRI_TRANSITIONS=92} [2023-08-03 15:23:41,759 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 37 predicate places. [2023-08-03 15:23:41,759 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 92 transitions, 377 flow [2023-08-03 15:23:41,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 216.3846153846154) internal successors, (2813), 13 states have internal predecessors, (2813), 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-03 15:23:41,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:41,768 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 15:23:41,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-03 15:23:41,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:41,975 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:23:41,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1266609288, now seen corresponding path program 2 times [2023-08-03 15:23:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:41,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847859201] [2023-08-03 15:23:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:41,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:23:42,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:42,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847859201] [2023-08-03 15:23:42,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847859201] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:42,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353343565] [2023-08-03 15:23:42,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:23:42,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:42,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:42,025 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:23:42,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 15:23:42,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:23:42,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:23:42,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 15:23:42,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:23:42,129 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:23:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353343565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:23:42,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:23:42,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 15:23:42,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318621424] [2023-08-03 15:23:42,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:23:42,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:23:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:42,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:23:42,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 15:23:42,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 15:23:42,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 92 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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-03 15:23:42,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:42,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 15:23:42,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:43,251 INFO L124 PetriNetUnfolderBase]: 10256/16877 cut-off events. [2023-08-03 15:23:43,252 INFO L125 PetriNetUnfolderBase]: For 5132/5132 co-relation queries the response was YES. [2023-08-03 15:23:43,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37186 conditions, 16877 events. 10256/16877 cut-off events. For 5132/5132 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 122524 event pairs, 612 based on Foata normal form. 272/16197 useless extension candidates. Maximal degree in co-relation 37102. Up to 14984 conditions per place. [2023-08-03 15:23:43,318 INFO L140 encePairwiseOnDemand]: 481/485 looper letters, 128 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2023-08-03 15:23:43,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 143 transitions, 779 flow [2023-08-03 15:23:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:23:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:23:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1182 transitions. [2023-08-03 15:23:43,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48742268041237113 [2023-08-03 15:23:43,321 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1182 transitions. [2023-08-03 15:23:43,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1182 transitions. [2023-08-03 15:23:43,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:43,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1182 transitions. [2023-08-03 15:23:43,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 236.4) internal successors, (1182), 5 states have internal predecessors, (1182), 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-03 15:23:43,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 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-03 15:23:43,326 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 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-03 15:23:43,326 INFO L175 Difference]: Start difference. First operand has 105 places, 92 transitions, 377 flow. Second operand 5 states and 1182 transitions. [2023-08-03 15:23:43,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 143 transitions, 779 flow [2023-08-03 15:23:43,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 143 transitions, 727 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-03 15:23:43,335 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 340 flow [2023-08-03 15:23:43,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=340, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2023-08-03 15:23:43,336 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 35 predicate places. [2023-08-03 15:23:43,336 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 340 flow [2023-08-03 15:23:43,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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-03 15:23:43,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:43,336 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:23:43,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-03 15:23:43,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-03 15:23:43,541 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:23:43,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1879227944, now seen corresponding path program 1 times [2023-08-03 15:23:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:43,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728584466] [2023-08-03 15:23:43,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:43,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:23:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:43,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728584466] [2023-08-03 15:23:43,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728584466] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:43,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624894839] [2023-08-03 15:23:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:43,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:43,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:43,637 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:23:43,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 15:23:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:43,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 15:23:43,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:23:43,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:23:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:23:43,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624894839] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:23:43,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:23:43,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 15:23:43,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735406682] [2023-08-03 15:23:43,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:23:43,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:23:43,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:43,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:23:43,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:23:43,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 485 [2023-08-03 15:23:43,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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-03 15:23:43,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:43,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 485 [2023-08-03 15:23:43,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:44,679 INFO L124 PetriNetUnfolderBase]: 10028/16408 cut-off events. [2023-08-03 15:23:44,680 INFO L125 PetriNetUnfolderBase]: For 6473/6473 co-relation queries the response was YES. [2023-08-03 15:23:44,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36977 conditions, 16408 events. 10028/16408 cut-off events. For 6473/6473 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 116150 event pairs, 171 based on Foata normal form. 17/15501 useless extension candidates. Maximal degree in co-relation 36916. Up to 14576 conditions per place. [2023-08-03 15:23:44,735 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 128 selfloop transitions, 3 changer transitions 0/142 dead transitions. [2023-08-03 15:23:44,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 142 transitions, 736 flow [2023-08-03 15:23:44,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:23:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:23:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 966 transitions. [2023-08-03 15:23:44,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979381443298969 [2023-08-03 15:23:44,737 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 966 transitions. [2023-08-03 15:23:44,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 966 transitions. [2023-08-03 15:23:44,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:44,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 966 transitions. [2023-08-03 15:23:44,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 241.5) internal successors, (966), 4 states have internal predecessors, (966), 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-03 15:23:44,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 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-03 15:23:44,741 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 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-03 15:23:44,741 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 340 flow. Second operand 4 states and 966 transitions. [2023-08-03 15:23:44,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 142 transitions, 736 flow [2023-08-03 15:23:44,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 142 transitions, 731 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 15:23:44,756 INFO L231 Difference]: Finished difference. Result has 104 places, 91 transitions, 333 flow [2023-08-03 15:23:44,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=104, PETRI_TRANSITIONS=91} [2023-08-03 15:23:44,756 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-08-03 15:23:44,756 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 91 transitions, 333 flow [2023-08-03 15:23:44,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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-03 15:23:44,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:44,757 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:23:44,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-03 15:23:44,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:44,961 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:23:44,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:44,961 INFO L85 PathProgramCache]: Analyzing trace with hash -339201700, now seen corresponding path program 1 times [2023-08-03 15:23:44,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:44,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362553683] [2023-08-03 15:23:44,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:44,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:23:45,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:45,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362553683] [2023-08-03 15:23:45,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362553683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:23:45,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:23:45,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 15:23:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79231826] [2023-08-03 15:23:45,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:23:45,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:23:45,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:45,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:23:45,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:23:45,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 485 [2023-08-03 15:23:45,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 91 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 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-03 15:23:45,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:45,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 485 [2023-08-03 15:23:45,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:45,917 INFO L124 PetriNetUnfolderBase]: 5211/9599 cut-off events. [2023-08-03 15:23:45,917 INFO L125 PetriNetUnfolderBase]: For 4422/4422 co-relation queries the response was YES. [2023-08-03 15:23:45,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22413 conditions, 9599 events. 5211/9599 cut-off events. For 4422/4422 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 70694 event pairs, 2009 based on Foata normal form. 1420/10162 useless extension candidates. Maximal degree in co-relation 22352. Up to 5058 conditions per place. [2023-08-03 15:23:45,957 INFO L140 encePairwiseOnDemand]: 464/485 looper letters, 116 selfloop transitions, 21 changer transitions 2/148 dead transitions. [2023-08-03 15:23:45,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 148 transitions, 810 flow [2023-08-03 15:23:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:23:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:23:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 898 transitions. [2023-08-03 15:23:45,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46288659793814435 [2023-08-03 15:23:45,960 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 898 transitions. [2023-08-03 15:23:45,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 898 transitions. [2023-08-03 15:23:45,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:45,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 898 transitions. [2023-08-03 15:23:45,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 224.5) internal successors, (898), 4 states have internal predecessors, (898), 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-03 15:23:45,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 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-03 15:23:45,963 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 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-03 15:23:45,963 INFO L175 Difference]: Start difference. First operand has 104 places, 91 transitions, 333 flow. Second operand 4 states and 898 transitions. [2023-08-03 15:23:45,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 148 transitions, 810 flow [2023-08-03 15:23:45,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 148 transitions, 800 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 15:23:45,973 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 433 flow [2023-08-03 15:23:45,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=433, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2023-08-03 15:23:45,974 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 37 predicate places. [2023-08-03 15:23:45,974 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 433 flow [2023-08-03 15:23:45,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 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-03 15:23:45,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:45,975 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:23:45,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-03 15:23:45,975 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:23:45,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1412833901, now seen corresponding path program 1 times [2023-08-03 15:23:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935774301] [2023-08-03 15:23:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:45,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:23:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935774301] [2023-08-03 15:23:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935774301] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969767792] [2023-08-03 15:23:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:46,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:46,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:46,406 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:23:46,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-03 15:23:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:46,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-03 15:23:46,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:46,520 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 6 [2023-08-03 15:23:46,585 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:23:46,586 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:23:46,602 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:23:46,629 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:23:46,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2023-08-03 15:23:46,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:23:46,680 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 15:23:46,697 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 22 treesize of output 17 [2023-08-03 15:23:46,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:23:46,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 15:23:46,778 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:23:46,779 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 15:23:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:23:46,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:23:46,873 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_78| Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_78| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_78| 1) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_469) |c_~#a~0.base|) (+ |c_~#a~0.offset| (- 24) .cse0)) 0)) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_78|)))) is different from false [2023-08-03 15:23:46,968 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:23:46,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 15:23:46,978 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:23:46,978 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 15:23:46,984 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 25 treesize of output 18 [2023-08-03 15:24:11,243 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_463 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_78| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_78| 1) (forall ((v_ArrVal_467 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_72| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_463) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_72| 28) |~#a~0.offset|) v_ArrVal_467) (+ |~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_78| 28))) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_78| |v_t_funThread1of2ForFork0_~i~0#1_72|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_78|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 15:24:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 15:24:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969767792] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:24:14,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:24:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-03 15:24:14,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915665668] [2023-08-03 15:24:14,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:24:14,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 15:24:14,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:24:14,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 15:24:14,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=263, Unknown=13, NotChecked=74, Total=462 [2023-08-03 15:24:14,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 485 [2023-08-03 15:24:14,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 433 flow. Second operand has 22 states, 22 states have (on average 151.3181818181818) internal successors, (3329), 22 states have internal predecessors, (3329), 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-03 15:24:14,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:24:14,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 485 [2023-08-03 15:24:14,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:24:19,017 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 [0] [2023-08-03 15:24:21,034 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 [0] [2023-08-03 15:24:23,594 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 [0] [2023-08-03 15:24:25,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-03 15:24:30,351 INFO L124 PetriNetUnfolderBase]: 8200/14931 cut-off events. [2023-08-03 15:24:30,351 INFO L125 PetriNetUnfolderBase]: For 9052/9080 co-relation queries the response was YES. [2023-08-03 15:24:30,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41225 conditions, 14931 events. 8200/14931 cut-off events. For 9052/9080 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 117775 event pairs, 753 based on Foata normal form. 61/13673 useless extension candidates. Maximal degree in co-relation 41162. Up to 7282 conditions per place. [2023-08-03 15:24:30,437 INFO L140 encePairwiseOnDemand]: 467/485 looper letters, 335 selfloop transitions, 100 changer transitions 125/568 dead transitions. [2023-08-03 15:24:30,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 568 transitions, 3307 flow [2023-08-03 15:24:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-03 15:24:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-03 15:24:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3320 transitions. [2023-08-03 15:24:30,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602821486706457 [2023-08-03 15:24:30,444 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3320 transitions. [2023-08-03 15:24:30,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3320 transitions. [2023-08-03 15:24:30,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:24:30,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3320 transitions. [2023-08-03 15:24:30,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 174.73684210526315) internal successors, (3320), 19 states have internal predecessors, (3320), 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-03 15:24:30,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 485.0) internal successors, (9700), 20 states have internal predecessors, (9700), 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-03 15:24:30,457 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 485.0) internal successors, (9700), 20 states have internal predecessors, (9700), 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-03 15:24:30,458 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 433 flow. Second operand 19 states and 3320 transitions. [2023-08-03 15:24:30,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 568 transitions, 3307 flow [2023-08-03 15:24:30,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 568 transitions, 3306 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:24:30,479 INFO L231 Difference]: Finished difference. Result has 129 places, 193 transitions, 1139 flow [2023-08-03 15:24:30,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1139, PETRI_PLACES=129, PETRI_TRANSITIONS=193} [2023-08-03 15:24:30,479 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2023-08-03 15:24:30,479 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 193 transitions, 1139 flow [2023-08-03 15:24:30,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 151.3181818181818) internal successors, (3329), 22 states have internal predecessors, (3329), 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-03 15:24:30,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:24:30,480 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:24:30,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-03 15:24:30,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-03 15:24:30,685 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:24:30,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:24:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash 364689675, now seen corresponding path program 2 times [2023-08-03 15:24:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:24:30,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236137274] [2023-08-03 15:24:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:24:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:24:33,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:24:33,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236137274] [2023-08-03 15:24:33,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236137274] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:24:33,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272192106] [2023-08-03 15:24:33,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:24:33,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:24:33,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:24:33,233 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:24:33,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-03 15:24:33,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:24:33,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:24:33,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-03 15:24:33,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:24:33,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 6 [2023-08-03 15:24:33,452 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:24:33,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:24:33,481 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:24:33,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:24:33,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2023-08-03 15:24:33,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:24:33,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 15:24:33,664 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:24:33,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 15:24:33,707 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 22 treesize of output 17 [2023-08-03 15:24:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:24:33,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:24:33,999 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:24:34,000 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 15:24:34,008 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:24:34,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 15:24:34,018 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 25 treesize of output 18 [2023-08-03 15:24:55,008 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_550 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_74| Int)) (or (forall ((v_ArrVal_554 Int) (|v_t_funThread2of2ForFork0_~i~0#1_80| Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_80| |v_t_funThread1of2ForFork0_~i~0#1_74|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_550) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_74| 28) |~#a~0.offset|) v_ArrVal_554) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_80| 28) |~#a~0.offset|)) 0))) (< |v_t_funThread1of2ForFork0_~i~0#1_74| 1) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_74|)))) is different from false [2023-08-03 15:24:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 15:24:58,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272192106] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:24:58,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:24:58,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 31 [2023-08-03 15:24:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906945077] [2023-08-03 15:24:58,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:24:58,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-03 15:24:58,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:24:58,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-03 15:24:58,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=809, Unknown=5, NotChecked=60, Total=1056 [2023-08-03 15:24:59,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 485 [2023-08-03 15:24:59,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 193 transitions, 1139 flow. Second operand has 33 states, 33 states have (on average 143.9090909090909) internal successors, (4749), 33 states have internal predecessors, (4749), 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-03 15:24:59,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:24:59,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 485 [2023-08-03 15:24:59,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:25:06,250 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-03 15:25:07,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:25:08,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:25:12,134 INFO L124 PetriNetUnfolderBase]: 12463/23063 cut-off events. [2023-08-03 15:25:12,135 INFO L125 PetriNetUnfolderBase]: For 31039/31069 co-relation queries the response was YES. [2023-08-03 15:25:12,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73660 conditions, 23063 events. 12463/23063 cut-off events. For 31039/31069 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 199467 event pairs, 2494 based on Foata normal form. 110/20918 useless extension candidates. Maximal degree in co-relation 73589. Up to 9479 conditions per place. [2023-08-03 15:25:12,330 INFO L140 encePairwiseOnDemand]: 463/485 looper letters, 414 selfloop transitions, 137 changer transitions 128/687 dead transitions. [2023-08-03 15:25:12,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 687 transitions, 4860 flow [2023-08-03 15:25:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-03 15:25:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-03 15:25:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4477 transitions. [2023-08-03 15:25:12,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3296759941089838 [2023-08-03 15:25:12,338 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4477 transitions. [2023-08-03 15:25:12,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4477 transitions. [2023-08-03 15:25:12,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:12,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4477 transitions. [2023-08-03 15:25:12,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 159.89285714285714) internal successors, (4477), 28 states have internal predecessors, (4477), 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-03 15:25:12,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 485.0) internal successors, (14065), 29 states have internal predecessors, (14065), 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-03 15:25:12,356 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 485.0) internal successors, (14065), 29 states have internal predecessors, (14065), 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-03 15:25:12,356 INFO L175 Difference]: Start difference. First operand has 129 places, 193 transitions, 1139 flow. Second operand 28 states and 4477 transitions. [2023-08-03 15:25:12,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 687 transitions, 4860 flow [2023-08-03 15:25:12,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 687 transitions, 4860 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:25:12,467 INFO L231 Difference]: Finished difference. Result has 165 places, 267 transitions, 2121 flow [2023-08-03 15:25:12,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2121, PETRI_PLACES=165, PETRI_TRANSITIONS=267} [2023-08-03 15:25:12,468 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 97 predicate places. [2023-08-03 15:25:12,468 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 267 transitions, 2121 flow [2023-08-03 15:25:12,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 143.9090909090909) internal successors, (4749), 33 states have internal predecessors, (4749), 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-03 15:25:12,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:25:12,469 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:25:12,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-03 15:25:12,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-03 15:25:12,673 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:25:12,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:25:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2040308918, now seen corresponding path program 1 times [2023-08-03 15:25:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:25:12,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751699288] [2023-08-03 15:25:12,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:12,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:25:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:25:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:25:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751699288] [2023-08-03 15:25:14,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751699288] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:25:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896757452] [2023-08-03 15:25:14,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:14,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:25:14,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:25:14,281 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:25:14,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-03 15:25:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:14,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-03 15:25:14,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:25:14,390 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 6 [2023-08-03 15:25:14,454 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:25:14,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:25:14,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:25:14,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:25:14,523 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2023-08-03 15:25:14,562 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:25:14,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 15:25:14,623 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 22 treesize of output 17 [2023-08-03 15:25:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:25:14,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:25:14,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 19 [2023-08-03 15:25:14,816 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 15 treesize of output 8 [2023-08-03 15:25:22,923 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_82| Int) (|v_t_funThread1of2ForFork0_~i~0#1_76| Int) (v_ArrVal_636 (Array Int Int)) (v_ArrVal_640 Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_82| |v_t_funThread1of2ForFork0_~i~0#1_76|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_636) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_82| 28) |~#a~0.offset|) v_ArrVal_640) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_76| 28) |~#a~0.offset|)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_82| 1) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_82|))) is different from false [2023-08-03 15:25:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-03 15:25:23,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896757452] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:25:23,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:25:23,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 27 [2023-08-03 15:25:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771934720] [2023-08-03 15:25:23,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:25:23,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-03 15:25:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-03 15:25:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=585, Unknown=4, NotChecked=52, Total=812 [2023-08-03 15:25:23,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 485 [2023-08-03 15:25:23,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 267 transitions, 2121 flow. Second operand has 29 states, 29 states have (on average 147.17241379310346) internal successors, (4268), 29 states have internal predecessors, (4268), 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-03 15:25:23,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:25:23,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 485 [2023-08-03 15:25:23,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:25:27,271 INFO L124 PetriNetUnfolderBase]: 14675/27291 cut-off events. [2023-08-03 15:25:27,271 INFO L125 PetriNetUnfolderBase]: For 64606/64637 co-relation queries the response was YES. [2023-08-03 15:25:27,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97041 conditions, 27291 events. 14675/27291 cut-off events. For 64606/64637 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 243659 event pairs, 3512 based on Foata normal form. 49/24735 useless extension candidates. Maximal degree in co-relation 96950. Up to 15698 conditions per place. [2023-08-03 15:25:27,573 INFO L140 encePairwiseOnDemand]: 465/485 looper letters, 399 selfloop transitions, 94 changer transitions 144/645 dead transitions. [2023-08-03 15:25:27,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 645 transitions, 5329 flow [2023-08-03 15:25:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-03 15:25:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-03 15:25:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4192 transitions. [2023-08-03 15:25:27,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3324345757335448 [2023-08-03 15:25:27,576 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4192 transitions. [2023-08-03 15:25:27,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4192 transitions. [2023-08-03 15:25:27,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:27,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4192 transitions. [2023-08-03 15:25:27,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 161.23076923076923) internal successors, (4192), 26 states have internal predecessors, (4192), 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-03 15:25:27,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 485.0) internal successors, (13095), 27 states have internal predecessors, (13095), 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-03 15:25:27,590 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 485.0) internal successors, (13095), 27 states have internal predecessors, (13095), 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-03 15:25:27,590 INFO L175 Difference]: Start difference. First operand has 165 places, 267 transitions, 2121 flow. Second operand 26 states and 4192 transitions. [2023-08-03 15:25:27,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 645 transitions, 5329 flow [2023-08-03 15:25:27,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 645 transitions, 5273 flow, removed 11 selfloop flow, removed 17 redundant places. [2023-08-03 15:25:27,964 INFO L231 Difference]: Finished difference. Result has 182 places, 297 transitions, 2649 flow [2023-08-03 15:25:27,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2649, PETRI_PLACES=182, PETRI_TRANSITIONS=297} [2023-08-03 15:25:27,964 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 114 predicate places. [2023-08-03 15:25:27,964 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 297 transitions, 2649 flow [2023-08-03 15:25:27,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 147.17241379310346) internal successors, (4268), 29 states have internal predecessors, (4268), 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-03 15:25:27,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:25:27,965 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:25:27,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-03 15:25:28,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-03 15:25:28,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:25:28,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:25:28,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1762616659, now seen corresponding path program 3 times [2023-08-03 15:25:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:25:28,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900767192] [2023-08-03 15:25:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:28,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:25:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:25:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:25:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900767192] [2023-08-03 15:25:28,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900767192] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:25:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290977012] [2023-08-03 15:25:28,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 15:25:28,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:25:28,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:25:28,454 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:25:28,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-03 15:25:28,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 15:25:28,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:25:28,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-03 15:25:28,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:25:28,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 6 [2023-08-03 15:25:28,615 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:25:28,616 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:25:28,634 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:25:28,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:25:28,675 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2023-08-03 15:25:28,701 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:25:28,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 15:25:28,735 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 22 treesize of output 17 [2023-08-03 15:25:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:25:28,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:25:28,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 19 [2023-08-03 15:25:28,829 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 15 treesize of output 8 [2023-08-03 15:25:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:25:45,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290977012] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:25:45,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:25:45,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-03 15:25:45,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814186182] [2023-08-03 15:25:45,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:25:45,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-03 15:25:45,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:45,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-03 15:25:45,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=227, Unknown=7, NotChecked=0, Total=306 [2023-08-03 15:25:47,085 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-03 15:25:49,117 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-03 15:25:51,139 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-03 15:25:53,161 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-03 15:25:55,192 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-03 15:25:57,222 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-03 15:25:59,255 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-03 15:26:01,309 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-03 15:26:03,343 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-03 15:26:05,383 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-03 15:26:07,421 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-03 15:26:09,450 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-03 15:26:11,466 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-03 15:26:13,489 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-03 15:26:15,523 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-03 15:26:17,546 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-03 15:26:19,578 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-03 15:26:21,619 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-03 15:26:23,656 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-03 15:26:25,695 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-03 15:26:27,733 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-03 15:26:29,763 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-03 15:26:31,787 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-03 15:26:33,821 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-03 15:26:35,877 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-03 15:26:37,903 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-03 15:26:39,936 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-03 15:26:41,960 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-03 15:26:43,981 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-03 15:26:46,009 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-03 15:26:48,035 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-03 15:26:50,055 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-03 15:26:52,196 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-03 15:26:54,227 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-03 15:26:56,253 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-03 15:26:56,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 485 [2023-08-03 15:26:56,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 297 transitions, 2649 flow. Second operand has 18 states, 18 states have (on average 152.83333333333334) internal successors, (2751), 18 states have internal predecessors, (2751), 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-03 15:26:56,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:26:56,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 485 [2023-08-03 15:26:56,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:26:59,955 INFO L124 PetriNetUnfolderBase]: 16013/29959 cut-off events. [2023-08-03 15:26:59,955 INFO L125 PetriNetUnfolderBase]: For 106066/106128 co-relation queries the response was YES. [2023-08-03 15:27:00,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114821 conditions, 29959 events. 16013/29959 cut-off events. For 106066/106128 co-relation queries the response was YES. Maximal size of possible extension queue 1277. Compared 272803 event pairs, 3725 based on Foata normal form. 59/27208 useless extension candidates. Maximal degree in co-relation 114735. Up to 17945 conditions per place. [2023-08-03 15:27:00,182 INFO L140 encePairwiseOnDemand]: 469/485 looper letters, 411 selfloop transitions, 100 changer transitions 124/643 dead transitions. [2023-08-03 15:27:00,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 643 transitions, 6179 flow [2023-08-03 15:27:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-03 15:27:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-03 15:27:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2612 transitions. [2023-08-03 15:27:00,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35903780068728525 [2023-08-03 15:27:00,184 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2612 transitions. [2023-08-03 15:27:00,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2612 transitions. [2023-08-03 15:27:00,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:27:00,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2612 transitions. [2023-08-03 15:27:00,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 174.13333333333333) internal successors, (2612), 15 states have internal predecessors, (2612), 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-03 15:27:00,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 485.0) internal successors, (7760), 16 states have internal predecessors, (7760), 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-03 15:27:00,191 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 485.0) internal successors, (7760), 16 states have internal predecessors, (7760), 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-03 15:27:00,191 INFO L175 Difference]: Start difference. First operand has 182 places, 297 transitions, 2649 flow. Second operand 15 states and 2612 transitions. [2023-08-03 15:27:00,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 643 transitions, 6179 flow [2023-08-03 15:27:00,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 643 transitions, 5929 flow, removed 47 selfloop flow, removed 16 redundant places. [2023-08-03 15:27:00,682 INFO L231 Difference]: Finished difference. Result has 183 places, 328 transitions, 3129 flow [2023-08-03 15:27:00,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3129, PETRI_PLACES=183, PETRI_TRANSITIONS=328} [2023-08-03 15:27:00,682 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 115 predicate places. [2023-08-03 15:27:00,683 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 328 transitions, 3129 flow [2023-08-03 15:27:00,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 152.83333333333334) internal successors, (2751), 18 states have internal predecessors, (2751), 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-03 15:27:00,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:27:00,683 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:27:00,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-03 15:27:00,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-03 15:27:00,887 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:27:00,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:27:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1872272908, now seen corresponding path program 2 times [2023-08-03 15:27:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:27:00,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188988599] [2023-08-03 15:27:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:27:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:27:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:27:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:27:01,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:27:01,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188988599] [2023-08-03 15:27:01,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188988599] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:27:01,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033982104] [2023-08-03 15:27:01,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:27:01,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:27:01,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:27:01,350 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:27:01,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-03 15:27:01,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:27:01,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:27:01,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-03 15:27:01,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:27:01,490 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 6 [2023-08-03 15:27:01,562 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:27:01,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:27:01,581 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:27:01,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:27:01,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2023-08-03 15:27:01,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:27:01,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 15:27:01,684 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:27:01,685 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 15:27:01,707 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 22 treesize of output 17 [2023-08-03 15:27:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:27:01,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:27:01,796 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_80| Int) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_811 Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_80| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_811) (+ |c_~#a~0.offset| .cse0)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_809) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 (- 24))) 0))))) is different from false [2023-08-03 15:27:01,810 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:27:01,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 15:27:01,817 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:27:01,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 15:27:01,824 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 25 treesize of output 18 [2023-08-03 15:27:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:27:16,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033982104] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:27:16,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:27:16,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-03 15:27:16,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795620367] [2023-08-03 15:27:16,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:27:16,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 15:27:16,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:27:16,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 15:27:16,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=295, Unknown=3, NotChecked=36, Total=420 [2023-08-03 15:27:18,261 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-03 15:27:18,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 485 [2023-08-03 15:27:18,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 328 transitions, 3129 flow. Second operand has 21 states, 21 states have (on average 151.38095238095238) internal successors, (3179), 21 states have internal predecessors, (3179), 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-03 15:27:18,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:27:18,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 485 [2023-08-03 15:27:18,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:27:21,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-03 15:27:24,105 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-03 15:27:29,142 INFO L124 PetriNetUnfolderBase]: 18213/34392 cut-off events. [2023-08-03 15:27:29,142 INFO L125 PetriNetUnfolderBase]: For 124463/124541 co-relation queries the response was YES. [2023-08-03 15:27:29,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133525 conditions, 34392 events. 18213/34392 cut-off events. For 124463/124541 co-relation queries the response was YES. Maximal size of possible extension queue 1491. Compared 323275 event pairs, 4255 based on Foata normal form. 98/31370 useless extension candidates. Maximal degree in co-relation 133442. Up to 18979 conditions per place. [2023-08-03 15:27:29,321 INFO L140 encePairwiseOnDemand]: 467/485 looper letters, 459 selfloop transitions, 116 changer transitions 125/708 dead transitions. [2023-08-03 15:27:29,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 708 transitions, 6760 flow [2023-08-03 15:27:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-03 15:27:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-03 15:27:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2962 transitions. [2023-08-03 15:27:29,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35924802910855064 [2023-08-03 15:27:29,323 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2962 transitions. [2023-08-03 15:27:29,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2962 transitions. [2023-08-03 15:27:29,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:27:29,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2962 transitions. [2023-08-03 15:27:29,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 174.23529411764707) internal successors, (2962), 17 states have internal predecessors, (2962), 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-03 15:27:29,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 485.0) internal successors, (8730), 18 states have internal predecessors, (8730), 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-03 15:27:29,330 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 485.0) internal successors, (8730), 18 states have internal predecessors, (8730), 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-03 15:27:29,330 INFO L175 Difference]: Start difference. First operand has 183 places, 328 transitions, 3129 flow. Second operand 17 states and 2962 transitions. [2023-08-03 15:27:29,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 708 transitions, 6760 flow [2023-08-03 15:27:29,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 708 transitions, 6565 flow, removed 47 selfloop flow, removed 4 redundant places. [2023-08-03 15:27:29,983 INFO L231 Difference]: Finished difference. Result has 203 places, 343 transitions, 3467 flow [2023-08-03 15:27:29,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=2995, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3467, PETRI_PLACES=203, PETRI_TRANSITIONS=343} [2023-08-03 15:27:29,984 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 135 predicate places. [2023-08-03 15:27:29,984 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 343 transitions, 3467 flow [2023-08-03 15:27:29,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 151.38095238095238) internal successors, (3179), 21 states have internal predecessors, (3179), 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-03 15:27:29,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:27:29,984 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:27:29,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-03 15:27:30,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:27:30,195 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:27:30,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:27:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1699303692, now seen corresponding path program 3 times [2023-08-03 15:27:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:27:30,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960751841] [2023-08-03 15:27:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:27:30,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:27:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:27:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:27:30,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:27:30,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960751841] [2023-08-03 15:27:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960751841] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:27:30,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320564681] [2023-08-03 15:27:30,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 15:27:30,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:27:30,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:27:30,561 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:27:30,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-03 15:27:30,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 15:27:30,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:27:30,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-03 15:27:30,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:27:30,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 6 [2023-08-03 15:27:30,757 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:27:30,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:27:30,776 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:27:30,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:27:30,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2023-08-03 15:27:30,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:27:30,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 15:27:30,980 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 22 treesize of output 17 [2023-08-03 15:27:31,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:27:31,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 15:27:31,040 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:27:31,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 15:27:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:27:31,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:27:31,096 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_82| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_82| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_898) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| (- 24))) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-03 15:27:31,145 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:27:31,145 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 15:27:31,152 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:27:31,152 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 15:27:31,155 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 25 treesize of output 18 [2023-08-03 15:27:47,260 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:27:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:27:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320564681] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:27:49,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:27:49,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-03 15:27:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645361708] [2023-08-03 15:27:49,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:27:49,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 15:27:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:27:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 15:27:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=267, Unknown=5, NotChecked=36, Total=420 [2023-08-03 15:27:49,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 485 [2023-08-03 15:27:49,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 343 transitions, 3467 flow. Second operand has 21 states, 21 states have (on average 151.38095238095238) internal successors, (3179), 21 states have internal predecessors, (3179), 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-03 15:27:49,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:27:49,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 485 [2023-08-03 15:27:49,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:27:51,919 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 [0] [2023-08-03 15:27:53,931 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 [0] [2023-08-03 15:28:03,342 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-03 15:28:05,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:28:07,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-03 15:28:08,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:28:10,905 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-03 15:28:13,852 INFO L124 PetriNetUnfolderBase]: 19092/36079 cut-off events. [2023-08-03 15:28:13,853 INFO L125 PetriNetUnfolderBase]: For 148270/148276 co-relation queries the response was YES. [2023-08-03 15:28:14,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144172 conditions, 36079 events. 19092/36079 cut-off events. For 148270/148276 co-relation queries the response was YES. Maximal size of possible extension queue 1630. Compared 342745 event pairs, 4048 based on Foata normal form. 52/32929 useless extension candidates. Maximal degree in co-relation 144081. Up to 20307 conditions per place. [2023-08-03 15:28:14,087 INFO L140 encePairwiseOnDemand]: 466/485 looper letters, 444 selfloop transitions, 173 changer transitions 80/705 dead transitions. [2023-08-03 15:28:14,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 705 transitions, 7182 flow [2023-08-03 15:28:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-03 15:28:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-03 15:28:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2788 transitions. [2023-08-03 15:28:14,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3592783505154639 [2023-08-03 15:28:14,090 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2788 transitions. [2023-08-03 15:28:14,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2788 transitions. [2023-08-03 15:28:14,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:28:14,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2788 transitions. [2023-08-03 15:28:14,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 174.25) internal successors, (2788), 16 states have internal predecessors, (2788), 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-03 15:28:14,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 485.0) internal successors, (8245), 17 states have internal predecessors, (8245), 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-03 15:28:14,096 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 485.0) internal successors, (8245), 17 states have internal predecessors, (8245), 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-03 15:28:14,096 INFO L175 Difference]: Start difference. First operand has 203 places, 343 transitions, 3467 flow. Second operand 16 states and 2788 transitions. [2023-08-03 15:28:14,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 705 transitions, 7182 flow [2023-08-03 15:28:15,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 705 transitions, 7001 flow, removed 30 selfloop flow, removed 5 redundant places. [2023-08-03 15:28:15,131 INFO L231 Difference]: Finished difference. Result has 219 places, 408 transitions, 4563 flow [2023-08-03 15:28:15,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=3310, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4563, PETRI_PLACES=219, PETRI_TRANSITIONS=408} [2023-08-03 15:28:15,132 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 151 predicate places. [2023-08-03 15:28:15,132 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 408 transitions, 4563 flow [2023-08-03 15:28:15,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 151.38095238095238) internal successors, (3179), 21 states have internal predecessors, (3179), 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-03 15:28:15,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:28:15,132 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:28:15,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-03 15:28:15,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:28:15,336 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:28:15,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:28:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash -321806055, now seen corresponding path program 4 times [2023-08-03 15:28:15,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:28:15,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13316287] [2023-08-03 15:28:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:28:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:28:15,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:28:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13316287] [2023-08-03 15:28:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13316287] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:28:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568593448] [2023-08-03 15:28:15,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 15:28:15,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:28:15,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:28:15,695 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:28:15,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-03 15:28:15,812 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 15:28:15,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:28:15,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-03 15:28:15,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:28:15,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 6 [2023-08-03 15:28:15,898 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:28:15,899 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-03 15:28:15,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-03 15:28:15,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 12 [2023-08-03 15:28:15,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:15,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 15:28:16,010 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 22 treesize of output 17 [2023-08-03 15:28:16,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:28:16,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-03 15:28:16,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-03 15:28:16,105 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:28:16,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2023-08-03 15:28:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-03 15:28:16,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:28:16,234 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_985 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_90| Int) (v_ArrVal_984 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_90| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_984) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 (- 24))) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_985) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2023-08-03 15:28:16,242 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 Int) (v_ArrVal_985 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_90| Int) (v_ArrVal_984 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_90| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_984) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 (- 24))) 0)) (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_983)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_985) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)))))) is different from false [2023-08-03 15:28:16,370 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:28:16,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-03 15:28:16,379 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:28:16,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-03 15:28:16,384 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 25 treesize of output 18 [2023-08-03 15:28:16,407 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_983 Int) (v_ArrVal_985 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_84| Int) (|v_t_funThread2of2ForFork0_~i~0#1_90| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_84| 28) |~#a~0.offset|) v_ArrVal_983)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_985) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_90| 28) |~#a~0.offset|)) 0))) (forall ((v_ArrVal_983 Int) (v_ArrVal_985 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_84| Int) (|v_t_funThread2of2ForFork0_~i~0#1_90| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_84| 28) |~#a~0.offset|) v_ArrVal_983)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_985) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_90| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_90| |v_t_funThread1of2ForFork0_~i~0#1_84|))))) is different from false [2023-08-03 15:28:18,450 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_983 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_84| Int) (|v_t_funThread2of2ForFork0_~i~0#1_90| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_978))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_84| 28) |~#a~0.offset|) v_ArrVal_983))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_985) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_90| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_90| |v_t_funThread1of2ForFork0_~i~0#1_84|))) (or (forall ((v_ArrVal_983 Int) (v_ArrVal_985 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_84| Int) (|v_t_funThread2of2ForFork0_~i~0#1_90| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_978))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_84| 28) |~#a~0.offset|) v_ArrVal_983))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_985) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_90| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-03 15:28:26,524 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:28:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-03 15:28:26,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568593448] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:28:26,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:28:26,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-08-03 15:28:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117834922] [2023-08-03 15:28:26,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:28:26,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-03 15:28:26,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:28:26,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-03 15:28:26,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=276, Unknown=5, NotChecked=156, Total=552 [2023-08-03 15:28:27,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 485 [2023-08-03 15:28:27,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 408 transitions, 4563 flow. Second operand has 24 states, 24 states have (on average 149.125) internal successors, (3579), 24 states have internal predecessors, (3579), 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-03 15:28:27,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:28:27,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 485 [2023-08-03 15:28:27,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:28:29,224 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 [0] [2023-08-03 15:28:31,235 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 [0] [2023-08-03 15:28:33,242 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] [2023-08-03 15:28:39,595 INFO L124 PetriNetUnfolderBase]: 19250/36504 cut-off events. [2023-08-03 15:28:39,596 INFO L125 PetriNetUnfolderBase]: For 189134/189239 co-relation queries the response was YES. [2023-08-03 15:28:39,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156292 conditions, 36504 events. 19250/36504 cut-off events. For 189134/189239 co-relation queries the response was YES. Maximal size of possible extension queue 1669. Compared 349120 event pairs, 4247 based on Foata normal form. 9/33286 useless extension candidates. Maximal degree in co-relation 156190. Up to 23719 conditions per place. [2023-08-03 15:28:40,002 INFO L140 encePairwiseOnDemand]: 469/485 looper letters, 426 selfloop transitions, 164 changer transitions 130/728 dead transitions. [2023-08-03 15:28:40,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 728 transitions, 8377 flow [2023-08-03 15:28:40,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-03 15:28:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-03 15:28:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2245 transitions. [2023-08-03 15:28:40,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560666137985726 [2023-08-03 15:28:40,004 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2245 transitions. [2023-08-03 15:28:40,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2245 transitions. [2023-08-03 15:28:40,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:28:40,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2245 transitions. [2023-08-03 15:28:40,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 172.69230769230768) internal successors, (2245), 13 states have internal predecessors, (2245), 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-03 15:28:40,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 485.0) internal successors, (6790), 14 states have internal predecessors, (6790), 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-03 15:28:40,013 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 485.0) internal successors, (6790), 14 states have internal predecessors, (6790), 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-03 15:28:40,013 INFO L175 Difference]: Start difference. First operand has 219 places, 408 transitions, 4563 flow. Second operand 13 states and 2245 transitions. [2023-08-03 15:28:40,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 728 transitions, 8377 flow [2023-08-03 15:28:42,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 728 transitions, 8050 flow, removed 96 selfloop flow, removed 5 redundant places. [2023-08-03 15:28:42,269 INFO L231 Difference]: Finished difference. Result has 232 places, 434 transitions, 5028 flow [2023-08-03 15:28:42,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=4264, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5028, PETRI_PLACES=232, PETRI_TRANSITIONS=434} [2023-08-03 15:28:42,269 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 164 predicate places. [2023-08-03 15:28:42,270 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 434 transitions, 5028 flow [2023-08-03 15:28:42,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 149.125) internal successors, (3579), 24 states have internal predecessors, (3579), 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-03 15:28:42,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:28:42,270 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:28:42,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-03 15:28:42,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:28:42,475 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-03 15:28:42,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:28:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash 791760339, now seen corresponding path program 1 times [2023-08-03 15:28:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:28:42,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867036133] [2023-08-03 15:28:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:28:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:28:42,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 15:28:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:28:42,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 15:28:42,506 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 15:28:42,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-03 15:28:42,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-08-03 15:28:42,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-03 15:28:42,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-08-03 15:28:42,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 15:28:42,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-03 15:28:42,506 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 15:28:42,509 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 15:28:42,509 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 15:28:42,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 03:28:42 BasicIcfg [2023-08-03 15:28:42,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 15:28:42,539 INFO L158 Benchmark]: Toolchain (without parser) took 315512.45ms. Allocated memory was 354.4MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 305.7MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-08-03 15:28:42,539 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 354.4MB. Free memory is still 307.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 15:28:42,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.42ms. Allocated memory is still 354.4MB. Free memory was 305.4MB in the beginning and 275.7MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-03 15:28:42,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.84ms. Allocated memory is still 354.4MB. Free memory was 275.7MB in the beginning and 273.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 15:28:42,540 INFO L158 Benchmark]: Boogie Preprocessor took 35.37ms. Allocated memory is still 354.4MB. Free memory was 273.0MB in the beginning and 270.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 15:28:42,540 INFO L158 Benchmark]: RCFGBuilder took 371.15ms. Allocated memory was 354.4MB in the beginning and 501.2MB in the end (delta: 146.8MB). Free memory was 270.9MB in the beginning and 461.0MB in the end (delta: -190.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.0GB. [2023-08-03 15:28:42,540 INFO L158 Benchmark]: TraceAbstraction took 314611.03ms. Allocated memory was 501.2MB in the beginning and 4.8GB in the end (delta: 4.3GB). Free memory was 461.0MB in the beginning and 2.8GB in the end (delta: -2.3GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-08-03 15:28:42,541 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.10ms. Allocated memory is still 354.4MB. Free memory is still 307.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 451.42ms. Allocated memory is still 354.4MB. Free memory was 305.4MB in the beginning and 275.7MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.84ms. Allocated memory is still 354.4MB. Free memory was 275.7MB in the beginning and 273.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.37ms. Allocated memory is still 354.4MB. Free memory was 273.0MB in the beginning and 270.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 371.15ms. Allocated memory was 354.4MB in the beginning and 501.2MB in the end (delta: 146.8MB). Free memory was 270.9MB in the beginning and 461.0MB in the end (delta: -190.1MB). Peak memory consumption was 20.3MB. Max. memory is 16.0GB. * TraceAbstraction took 314611.03ms. Allocated memory was 501.2MB in the beginning and 4.8GB in the end (delta: 4.3GB). Free memory was 461.0MB in the beginning and 2.8GB in the end (delta: -2.3GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 161 PlacesBefore, 45 PlacesAfterwards, 188 TransitionsBefore, 66 TransitionsAfterwards, 10792 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 164 TotalNumberOfCompositions, 17790 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9093, independent: 8818, independent conditional: 0, independent unconditional: 8818, dependent: 275, dependent conditional: 0, dependent unconditional: 275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5389, independent: 5328, independent conditional: 0, independent unconditional: 5328, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9093, independent: 3490, independent conditional: 0, independent unconditional: 3490, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 5389, unknown conditional: 0, unknown unconditional: 5389] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 226 PlacesBefore, 68 PlacesAfterwards, 266 TransitionsBefore, 101 TransitionsAfterwards, 33228 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 143 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 29 ConcurrentYvCompositions, 7 ChoiceCompositions, 219 TotalNumberOfCompositions, 56804 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27084, independent: 26654, independent conditional: 0, independent unconditional: 26654, dependent: 430, dependent conditional: 0, dependent unconditional: 430, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16451, independent: 16337, independent conditional: 0, independent unconditional: 16337, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27084, independent: 10317, independent conditional: 0, independent unconditional: 10317, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 16451, unknown conditional: 0, unknown unconditional: 16451] , Statistics on independence cache: Total cache size (in pairs): 496, Positive cache size: 444, Positive conditional cache size: 0, Positive unconditional cache size: 444, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 929]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L934] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L935-L938] 0 struct s { int datum; pthread_mutex_t mutex; } a[10]; [L950] 0 int i = 0; VAL [__global_lock={3:0}, a={4:0}, i=0] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=1] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=2] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=3] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=4] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=5] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=6] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=7] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=8] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=9] [L950] COND TRUE 0 i < 10 [L950] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=10] [L950] COND FALSE 0 !(i < 10) [L952] 0 int i = __VERIFIER_nondet_int(); [L953] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L932] COND FALSE 0 !(!cond) [L953] RET 0 assume_abort_if_not(0 <= i && i < 10) [L954] 0 pthread_t t_ids[2]; [L954] 0 int i=0; VAL [__global_lock={3:0}, a={4:0}, i=0, i=1, i=10, t_ids={5:0}] [L954] COND TRUE 0 i<2 [L954] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [__global_lock={3:0}, a={4:0}, i=0, i=1, i=10, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=-2, t_ids={5:0}] [L954] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=1, i=1, i=10, t_ids={5:0}] [L954] COND TRUE 0 i<2 [L954] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [__global_lock={3:0}, a={4:0}, i=1, i=1, i=10, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=-1, t_ids={5:0}] [L954] 0 i++ VAL [__global_lock={3:0}, a={4:0}, i=1, i=10, i=2, t_ids={5:0}] [L954] COND FALSE 0 !(i<2) [L956] COND FALSE 0 !(__VERIFIER_nondet_int()) [L940] 1 int i = __VERIFIER_nondet_int(); [L941] CALL 1 assume_abort_if_not(0 <= i && i < 9) [L932] COND FALSE 1 !(!cond) [L941] RET 1 assume_abort_if_not(0 <= i && i < 9) [L942] 1 struct s *p = &a[i]; [L944] 1 i++ VAL [__global_lock={3:0}, a={4:0}, arg={0:0}, arg={0:0}, i=1, p={4:0}] [L945] COND TRUE 1 __VERIFIER_nondet_int() [L945] EXPR 1 a[i].datum [L945] 1 (a[i].datum)++ [L956] EXPR 0 a[i].datum [L956] CALL 0 __VERIFIER_assert((a[i].datum) == 0) [L929] COND TRUE 0 !(cond) [L929] 0 reach_error() VAL [\old(cond)=0, __global_lock={3:0}, a={4:0}, cond=0] - UnprovableResult [Line: 954]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 929]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 222 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.3s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 2 mSDtfsCounter, 571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 13/47 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, 281 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: 310.1s, OverallIterations: 16, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 173.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 232 mSolverCounterUnknown, 6338 SdHoareTripleChecker+Valid, 124.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6035 mSDsluCounter, 1643 SdHoareTripleChecker+Invalid, 123.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4305 IncrementalHoareTripleChecker+Unchecked, 1595 mSDsCounter, 900 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15796 IncrementalHoareTripleChecker+Invalid, 21233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 900 mSolverCounterUnsat, 48 mSDtfsCounter, 15796 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 735 GetRequests, 443 SyntacticMatches, 12 SemanticMatches, 280 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1641 ImplicationChecksByTransitivity, 133.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5028occurred in iteration=15, InterpolantAutomatonStates: 177, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 129.9s InterpolantComputationTime, 655 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 840 ConstructedInterpolants, 199 QuantifiedInterpolants, 15496 SizeOfPredicates, 82 NumberOfNonLiveVariables, 2540 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 1443/1627 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 15:28:42,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...