/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_74-tricky_address1_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 15:19:39,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 15:19:39,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 15:19:39,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 15:19:39,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 15:19:39,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 15:19:39,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 15:19:39,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 15:19:39,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 15:19:39,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 15:19:39,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 15:19:39,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 15:19:39,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 15:19:39,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 15:19:39,439 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 15:19:39,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 15:19:39,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 15:19:39,445 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 15:19:39,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 15:19:39,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 15:19:39,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 15:19:39,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 15:19:39,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 15:19:39,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 15:19:39,449 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 15:19:39,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 15:19:39,449 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 15:19:39,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 15:19:39,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 15:19:39,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 15:19:39,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:19:39,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 15:19:39,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 15:19:39,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 15:19:39,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 15:19:39,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 15:19:39,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 15:19:39,452 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 15:19:39,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 15:19:39,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 15:19:39,452 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 15:19:39,452 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:19:39,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 15:19:39,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 15:19:39,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 15:19:39,695 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 15:19:39,695 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 15:19:39,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i [2023-08-03 15:19:40,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 15:19:41,005 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 15:19:41,006 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i [2023-08-03 15:19:41,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ac3b66f/bf5e57789700461cb4b0b362a242fc3b/FLAG5e07ea37e [2023-08-03 15:19:41,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ac3b66f/bf5e57789700461cb4b0b362a242fc3b [2023-08-03 15:19:41,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 15:19:41,052 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 15:19:41,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 15:19:41,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 15:19:41,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 15:19:41,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313a8363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41, skipping insertion in model container [2023-08-03 15:19:41,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,119 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 15:19:41,538 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_74-tricky_address1_racefree_bound2.i[41323,41336] [2023-08-03 15:19:41,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:19:41,590 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 15:19:41,615 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 15:19:41,617 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 15:19:41,627 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-03 15:19:41,636 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_74-tricky_address1_racefree_bound2.i[41323,41336] [2023-08-03 15:19:41,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:19:41,719 INFO L206 MainTranslator]: Completed translation [2023-08-03 15:19:41,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41 WrapperNode [2023-08-03 15:19:41,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 15:19:41,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 15:19:41,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 15:19:41,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 15:19:41,728 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:19:41" (1/1) ... [2023-08-03 15:19:41,759 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:19:41" (1/1) ... [2023-08-03 15:19:41,790 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-08-03 15:19:41,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 15:19:41,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 15:19:41,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 15:19:41,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 15:19:41,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 15:19:41,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 15:19:41,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 15:19:41,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 15:19:41,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41" (1/1) ... [2023-08-03 15:19:41,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:19:41,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:41,869 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:19:41,879 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:19:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 15:19:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 15:19:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 15:19:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 15:19:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-03 15:19:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 15:19:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-03 15:19:41,904 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-03 15:19:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 15:19:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 15:19:41,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 15:19:41,905 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:19:42,062 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 15:19:42,064 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 15:19:42,354 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 15:19:42,361 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 15:19:42,361 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-03 15:19:42,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:19:42 BoogieIcfgContainer [2023-08-03 15:19:42,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 15:19:42,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 15:19:42,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 15:19:42,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 15:19:42,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 03:19:41" (1/3) ... [2023-08-03 15:19:42,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c1597f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:19:42, skipping insertion in model container [2023-08-03 15:19:42,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:19:41" (2/3) ... [2023-08-03 15:19:42,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c1597f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:19:42, skipping insertion in model container [2023-08-03 15:19:42,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:19:42" (3/3) ... [2023-08-03 15:19:42,369 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_74-tricky_address1_racefree_bound2.i [2023-08-03 15:19:42,375 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 15:19:42,382 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 15:19:42,383 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 15:19:42,383 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 15:19:42,440 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-03 15:19:42,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-03 15:19:42,534 INFO L124 PetriNetUnfolderBase]: 45/260 cut-off events. [2023-08-03 15:19:42,534 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-03 15:19:42,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-03 15:19:42,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-03 15:19:42,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-03 15:19:42,552 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:19:42,559 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-03 15:19:42,562 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-03 15:19:42,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-03 15:19:42,597 INFO L124 PetriNetUnfolderBase]: 44/255 cut-off events. [2023-08-03 15:19:42,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:19:42,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-03 15:19:42,604 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-03 15:19:45,161 INFO L134 LiptonReduction]: Checked pairs total: 15158 [2023-08-03 15:19:45,162 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-03 15:19:45,173 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:19:45,179 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;@479c43c6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:19:45,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 15:19:45,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:19:45,185 INFO L124 PetriNetUnfolderBase]: 5/25 cut-off events. [2023-08-03 15:19:45,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:19:45,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:45,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 15:19:45,186 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:19:45,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash 826457834, now seen corresponding path program 1 times [2023-08-03 15:19:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:45,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864282424] [2023-08-03 15:19:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:45,429 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:19:45,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864282424] [2023-08-03 15:19:45,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864282424] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:19:45,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:19:45,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:19:45,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941370870] [2023-08-03 15:19:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:19:45,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:19:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:45,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:19:45,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:19:45,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-03 15:19:45,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 65 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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:19:45,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:45,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-03 15:19:45,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:45,626 INFO L124 PetriNetUnfolderBase]: 301/651 cut-off events. [2023-08-03 15:19:45,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:19:45,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 651 events. 301/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3189 event pairs, 266 based on Foata normal form. 107/643 useless extension candidates. Maximal degree in co-relation 1189. Up to 588 conditions per place. [2023-08-03 15:19:45,631 INFO L140 encePairwiseOnDemand]: 318/341 looper letters, 36 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-03 15:19:45,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-03 15:19:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:19:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:19:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-08-03 15:19:45,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512218963831867 [2023-08-03 15:19:45,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-08-03 15:19:45,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-08-03 15:19:45,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:45,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-08-03 15:19:45,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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:19:45,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 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:19:45,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 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:19:45,659 INFO L175 Difference]: Start difference. First operand has 45 places, 65 transitions, 135 flow. Second operand 3 states and 524 transitions. [2023-08-03 15:19:45,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-03 15:19:45,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:19:45,663 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 107 flow [2023-08-03 15:19:45,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-08-03 15:19:45,668 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-03 15:19:45,668 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 107 flow [2023-08-03 15:19:45,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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:19:45,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:45,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:19:45,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 15:19:45,669 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:19:45,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:45,670 INFO L85 PathProgramCache]: Analyzing trace with hash -669135341, now seen corresponding path program 1 times [2023-08-03 15:19:45,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:45,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657908064] [2023-08-03 15:19:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:45,784 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:19:45,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:45,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657908064] [2023-08-03 15:19:45,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657908064] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:19:45,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136082450] [2023-08-03 15:19:45,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:45,801 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:19:45,821 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:19:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:45,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 15:19:45,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:19:45,898 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:19:45,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:19:45,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136082450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:19:45,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:19:45,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 15:19:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198983806] [2023-08-03 15:19:45,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:19:45,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:19:45,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:45,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:19:45,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:19:45,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-03 15:19:45,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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:19:45,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:45,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-03 15:19:45,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:46,008 INFO L124 PetriNetUnfolderBase]: 283/635 cut-off events. [2023-08-03 15:19:46,008 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:19:46,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 635 events. 283/635 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3546 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1221. Up to 555 conditions per place. [2023-08-03 15:19:46,012 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-03 15:19:46,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 243 flow [2023-08-03 15:19:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:19:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:19:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-08-03 15:19:46,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063538611925709 [2023-08-03 15:19:46,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-08-03 15:19:46,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-08-03 15:19:46,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:46,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-08-03 15:19:46,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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:19:46,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 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:19:46,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 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:19:46,019 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 107 flow. Second operand 3 states and 518 transitions. [2023-08-03 15:19:46,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 243 flow [2023-08-03 15:19:46,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 239 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 15:19:46,021 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 111 flow [2023-08-03 15:19:46,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-03 15:19:46,022 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-08-03 15:19:46,022 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 111 flow [2023-08-03 15:19:46,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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:19:46,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:46,023 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-03 15:19:46,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 15:19:46,228 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:19:46,229 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:19:46,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:46,229 INFO L85 PathProgramCache]: Analyzing trace with hash 716448256, now seen corresponding path program 1 times [2023-08-03 15:19:46,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:46,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209452991] [2023-08-03 15:19:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:46,303 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:19:46,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:46,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209452991] [2023-08-03 15:19:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209452991] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:19:46,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253467761] [2023-08-03 15:19:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:46,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:46,309 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:19:46,327 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:19:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:46,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 15:19:46,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:19:46,399 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:19:46,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:19:46,413 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:19:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253467761] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:19:46,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:19:46,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 15:19:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844630987] [2023-08-03 15:19:46,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:19:46,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 15:19:46,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:46,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 15:19:46,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 15:19:46,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-03 15:19:46,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 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:19:46,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:46,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-03 15:19:46,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:46,549 INFO L124 PetriNetUnfolderBase]: 301/637 cut-off events. [2023-08-03 15:19:46,549 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-03 15:19:46,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 637 events. 301/637 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3076 event pairs, 266 based on Foata normal form. 3/547 useless extension candidates. Maximal degree in co-relation 1245. Up to 571 conditions per place. [2023-08-03 15:19:46,551 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 36 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-08-03 15:19:46,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 205 flow [2023-08-03 15:19:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:19:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:19:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2023-08-03 15:19:46,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2023-08-03 15:19:46,554 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 968 transitions. [2023-08-03 15:19:46,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions. [2023-08-03 15:19:46,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:46,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions. [2023-08-03 15:19:46,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 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:19:46,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 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:19:46,561 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 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:19:46,561 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 111 flow. Second operand 6 states and 968 transitions. [2023-08-03 15:19:46,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 205 flow [2023-08-03 15:19:46,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 15:19:46,563 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 143 flow [2023-08-03 15:19:46,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-03 15:19:46,564 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-08-03 15:19:46,564 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 143 flow [2023-08-03 15:19:46,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 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:19:46,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:46,565 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-03 15:19:46,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 15:19:46,771 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:19:46,771 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:19:46,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1278120393, now seen corresponding path program 2 times [2023-08-03 15:19:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:46,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827914878] [2023-08-03 15:19:46,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:46,893 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:19:46,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:46,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827914878] [2023-08-03 15:19:46,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827914878] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:19:46,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223841348] [2023-08-03 15:19:46,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:19:46,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:46,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:46,896 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:19:46,897 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:19:46,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:19:46,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:19:46,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 15:19:46,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:19:46,985 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:19:46,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:19:47,033 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:19:47,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223841348] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:19:47,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:19:47,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 15:19:47,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480928859] [2023-08-03 15:19:47,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:19:47,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 15:19:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:47,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 15:19:47,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 15:19:47,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-03 15:19:47,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 143 flow. Second operand has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 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:19:47,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:47,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-03 15:19:47,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:47,231 INFO L124 PetriNetUnfolderBase]: 301/643 cut-off events. [2023-08-03 15:19:47,231 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-08-03 15:19:47,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 643 events. 301/643 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3080 event pairs, 266 based on Foata normal form. 6/556 useless extension candidates. Maximal degree in co-relation 1236. Up to 571 conditions per place. [2023-08-03 15:19:47,238 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 36 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2023-08-03 15:19:47,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 273 flow [2023-08-03 15:19:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 15:19:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 15:19:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1901 transitions. [2023-08-03 15:19:47,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645650048875855 [2023-08-03 15:19:47,243 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1901 transitions. [2023-08-03 15:19:47,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1901 transitions. [2023-08-03 15:19:47,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:47,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1901 transitions. [2023-08-03 15:19:47,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 158.41666666666666) internal successors, (1901), 12 states have internal predecessors, (1901), 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:19:47,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 341.0) internal successors, (4433), 13 states have internal predecessors, (4433), 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:19:47,255 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 341.0) internal successors, (4433), 13 states have internal predecessors, (4433), 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:19:47,255 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 143 flow. Second operand 12 states and 1901 transitions. [2023-08-03 15:19:47,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 273 flow [2023-08-03 15:19:47,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 259 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 15:19:47,258 INFO L231 Difference]: Finished difference. Result has 72 places, 55 transitions, 213 flow [2023-08-03 15:19:47,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=213, PETRI_PLACES=72, PETRI_TRANSITIONS=55} [2023-08-03 15:19:47,259 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2023-08-03 15:19:47,259 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 55 transitions, 213 flow [2023-08-03 15:19:47,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 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:19:47,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:47,260 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-03 15:19:47,269 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:19:47,465 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:19:47,468 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:19:47,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash 766826089, now seen corresponding path program 3 times [2023-08-03 15:19:47,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:47,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855895742] [2023-08-03 15:19:47,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:19:47,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 15:19:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:19:47,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 15:19:47,563 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 15:19:47,565 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-08-03 15:19:47,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 15:19:47,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 15:19:47,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 15:19:47,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 15:19:47,567 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-08-03 15:19:47,570 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 15:19:47,570 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 15:19:47,611 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-03 15:19:47,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 15:19:47,665 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-03 15:19:47,665 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 15:19:47,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-03 15:19:47,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 15:19:47,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-08-03 15:19:47,673 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:19:47,673 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-03 15:19:47,673 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-03 15:19:47,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-03 15:19:47,719 INFO L124 PetriNetUnfolderBase]: 75/424 cut-off events. [2023-08-03 15:19:47,719 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-03 15:19:47,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-03 15:19:47,740 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-08-03 15:19:50,724 INFO L134 LiptonReduction]: Checked pairs total: 55124 [2023-08-03 15:19:50,725 INFO L136 LiptonReduction]: Total number of compositions: 218 [2023-08-03 15:19:50,726 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:19:50,727 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;@479c43c6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:19:50,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-03 15:19:50,730 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:19:50,730 INFO L124 PetriNetUnfolderBase]: 7/23 cut-off events. [2023-08-03 15:19:50,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:19:50,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:50,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 15:19:50,730 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:19:50,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash -236515349, now seen corresponding path program 1 times [2023-08-03 15:19:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:50,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995742597] [2023-08-03 15:19:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:50,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:50,751 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:19:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995742597] [2023-08-03 15:19:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995742597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:19:50,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:19:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:19:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218383662] [2023-08-03 15:19:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:19:50,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:19:50,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:50,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:19:50,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:19:50,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 478 [2023-08-03 15:19:50,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 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:19:50,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:50,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 478 [2023-08-03 15:19:50,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:51,851 INFO L124 PetriNetUnfolderBase]: 9872/15757 cut-off events. [2023-08-03 15:19:51,851 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-03 15:19:51,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30205 conditions, 15757 events. 9872/15757 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 104377 event pairs, 9112 based on Foata normal form. 2730/16056 useless extension candidates. Maximal degree in co-relation 12164. Up to 14349 conditions per place. [2023-08-03 15:19:52,022 INFO L140 encePairwiseOnDemand]: 444/478 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-03 15:19:52,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-03 15:19:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:19:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:19:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2023-08-03 15:19:52,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50139470013947 [2023-08-03 15:19:52,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 719 transitions. [2023-08-03 15:19:52,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 719 transitions. [2023-08-03 15:19:52,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:52,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 719 transitions. [2023-08-03 15:19:52,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:19:52,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 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:19:52,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 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:19:52,031 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 719 transitions. [2023-08-03 15:19:52,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-03 15:19:52,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:19:52,033 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-03 15:19:52,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, 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:19:52,034 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 15:19:52,034 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-03 15:19:52,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 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:19:52,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:52,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:19:52,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 15:19:52,035 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:19:52,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1035577073, now seen corresponding path program 1 times [2023-08-03 15:19:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:52,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313806924] [2023-08-03 15:19:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:52,063 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:19:52,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:52,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313806924] [2023-08-03 15:19:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313806924] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:19:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978599569] [2023-08-03 15:19:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:52,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:52,065 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:19:52,068 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:19:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:52,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 15:19:52,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:19:52,139 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:19:52,139 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:19:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978599569] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:19:52,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:19:52,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 15:19:52,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360724294] [2023-08-03 15:19:52,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:19:52,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:19:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:19:52,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:19:52,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 478 [2023-08-03 15:19:52,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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:19:52,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:52,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 478 [2023-08-03 15:19:52,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:53,287 INFO L124 PetriNetUnfolderBase]: 9675/15570 cut-off events. [2023-08-03 15:19:53,288 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-03 15:19:53,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30030 conditions, 15570 events. 9675/15570 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 105521 event pairs, 4312 based on Foata normal form. 0/13126 useless extension candidates. Maximal degree in co-relation 30017. Up to 14317 conditions per place. [2023-08-03 15:19:53,353 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 72 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-03 15:19:53,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 350 flow [2023-08-03 15:19:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:19:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:19:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2023-08-03 15:19:53,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909344490934449 [2023-08-03 15:19:53,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2023-08-03 15:19:53,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2023-08-03 15:19:53,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:53,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2023-08-03 15:19:53,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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:19:53,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 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:19:53,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 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:19:53,360 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 704 transitions. [2023-08-03 15:19:53,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 350 flow [2023-08-03 15:19:53,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 15:19:53,364 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-03 15:19:53,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, 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:19:53,366 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-03 15:19:53,366 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-03 15:19:53,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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:19:53,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:53,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:19:53,372 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:19:53,572 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:19:53,572 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:19:53,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:53,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1764494610, now seen corresponding path program 1 times [2023-08-03 15:19:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262206896] [2023-08-03 15:19:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:53,622 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:19:53,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:53,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262206896] [2023-08-03 15:19:53,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262206896] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:19:53,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390578234] [2023-08-03 15:19:53,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:53,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:53,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:53,625 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:19:53,627 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:19:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:53,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 15:19:53,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:19:53,713 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:19:53,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:19:53,727 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:19:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390578234] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:19:53,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:19:53,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-03 15:19:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337101556] [2023-08-03 15:19:53,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:19:53,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 15:19:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:53,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 15:19:53,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-03 15:19:53,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 478 [2023-08-03 15:19:53,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:19:53,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:53,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 478 [2023-08-03 15:19:53,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:54,736 INFO L124 PetriNetUnfolderBase]: 9912/15619 cut-off events. [2023-08-03 15:19:54,736 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2023-08-03 15:19:54,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30593 conditions, 15619 events. 9912/15619 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 101707 event pairs, 9112 based on Foata normal form. 3/13422 useless extension candidates. Maximal degree in co-relation 30565. Up to 14334 conditions per place. [2023-08-03 15:19:54,793 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 56 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-03 15:19:54,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 310 flow [2023-08-03 15:19:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:19:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:19:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1317 transitions. [2023-08-03 15:19:54,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592050209205021 [2023-08-03 15:19:54,797 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1317 transitions. [2023-08-03 15:19:54,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1317 transitions. [2023-08-03 15:19:54,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:54,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1317 transitions. [2023-08-03 15:19:54,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.5) internal successors, (1317), 6 states have internal predecessors, (1317), 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:19:54,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 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:19:54,804 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 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:19:54,804 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1317 transitions. [2023-08-03 15:19:54,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 310 flow [2023-08-03 15:19:54,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:19:54,806 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-03 15:19:54,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, 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:19:54,807 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-03 15:19:54,807 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-03 15:19:54,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:19:54,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:54,808 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:19:54,817 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:19:55,013 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:19:55,013 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:19:55,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2032322840, now seen corresponding path program 2 times [2023-08-03 15:19:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970812114] [2023-08-03 15:19:55,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:55,105 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:19:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:55,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970812114] [2023-08-03 15:19:55,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970812114] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:19:55,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611495390] [2023-08-03 15:19:55,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:19:55,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:55,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:55,109 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:19:55,136 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:19:55,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-03 15:19:55,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:19:55,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-03 15:19:55,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:19:55,222 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:19:55,262 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:19:55,263 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:19:55,282 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:19:55,321 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:19:55,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:19:55,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611495390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:19:55,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:19:55,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-03 15:19:55,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683549945] [2023-08-03 15:19:55,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:19:55,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 15:19:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:55,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 15:19:55,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-03 15:19:55,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 478 [2023-08-03 15:19:55,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 201.5) internal successors, (1209), 6 states have internal predecessors, (1209), 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:19:55,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:55,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 478 [2023-08-03 15:19:55,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:56,719 INFO L124 PetriNetUnfolderBase]: 10227/16630 cut-off events. [2023-08-03 15:19:56,719 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2023-08-03 15:19:56,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32704 conditions, 16630 events. 10227/16630 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 116562 event pairs, 2011 based on Foata normal form. 0/14547 useless extension candidates. Maximal degree in co-relation 32668. Up to 11903 conditions per place. [2023-08-03 15:19:56,776 INFO L140 encePairwiseOnDemand]: 469/478 looper letters, 131 selfloop transitions, 14 changer transitions 9/167 dead transitions. [2023-08-03 15:19:56,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 167 transitions, 735 flow [2023-08-03 15:19:56,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 15:19:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 15:19:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions. [2023-08-03 15:19:56,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4710599721059972 [2023-08-03 15:19:56,781 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions. [2023-08-03 15:19:56,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions. [2023-08-03 15:19:56,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:56,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions. [2023-08-03 15:19:56,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 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:19:56,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 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:19:56,788 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 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:19:56,788 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1351 transitions. [2023-08-03 15:19:56,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 167 transitions, 735 flow [2023-08-03 15:19:56,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 167 transitions, 721 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 15:19:56,792 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-08-03 15:19:56,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, 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=280, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-08-03 15:19:56,795 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-03 15:19:56,795 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-08-03 15:19:56,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 201.5) internal successors, (1209), 6 states have internal predecessors, (1209), 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:19:56,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:56,796 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 15:19:56,805 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:19:57,003 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:19:57,003 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:19:57,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1964701426, now seen corresponding path program 1 times [2023-08-03 15:19:57,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:57,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766115412] [2023-08-03 15:19:57,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:57,080 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:19:57,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:57,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766115412] [2023-08-03 15:19:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766115412] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:19:57,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238966060] [2023-08-03 15:19:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:57,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:57,084 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:19:57,086 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:19:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:57,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 15:19:57,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:19:57,178 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:19:57,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:19:57,225 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:19:57,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238966060] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:19:57,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:19:57,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 15:19:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446144057] [2023-08-03 15:19:57,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:19:57,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 15:19:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:57,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 15:19:57,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-03 15:19:57,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 478 [2023-08-03 15:19:57,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 210.3846153846154) internal successors, (2735), 13 states have internal predecessors, (2735), 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:19:57,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:57,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 478 [2023-08-03 15:19:57,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:58,259 INFO L124 PetriNetUnfolderBase]: 10225/16589 cut-off events. [2023-08-03 15:19:58,259 INFO L125 PetriNetUnfolderBase]: For 3432/3437 co-relation queries the response was YES. [2023-08-03 15:19:58,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35719 conditions, 16589 events. 10225/16589 cut-off events. For 3432/3437 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 114452 event pairs, 9000 based on Foata normal form. 6/15204 useless extension candidates. Maximal degree in co-relation 35661. Up to 15411 conditions per place. [2023-08-03 15:19:58,318 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 68 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-03 15:19:58,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 474 flow [2023-08-03 15:19:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 15:19:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 15:19:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2580 transitions. [2023-08-03 15:19:58,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497907949790795 [2023-08-03 15:19:58,327 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2580 transitions. [2023-08-03 15:19:58,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2580 transitions. [2023-08-03 15:19:58,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:58,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2580 transitions. [2023-08-03 15:19:58,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 215.0) internal successors, (2580), 12 states have internal predecessors, (2580), 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:19:58,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 478.0) internal successors, (6214), 13 states have internal predecessors, (6214), 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:19:58,339 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 478.0) internal successors, (6214), 13 states have internal predecessors, (6214), 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:19:58,340 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2580 transitions. [2023-08-03 15:19:58,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 474 flow [2023-08-03 15:19:58,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:19:58,351 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-08-03 15:19:58,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=87, 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=364, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2023-08-03 15:19:58,352 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-08-03 15:19:58,352 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-08-03 15:19:58,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 210.3846153846154) internal successors, (2735), 13 states have internal predecessors, (2735), 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:19:58,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:58,365 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 15:19:58,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-03 15:19:58,570 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:19:58,570 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:19:58,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -193054414, now seen corresponding path program 2 times [2023-08-03 15:19:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:58,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248983923] [2023-08-03 15:19:58,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:58,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:19:58,644 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:19:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:19:58,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248983923] [2023-08-03 15:19:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248983923] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:19:58,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156026696] [2023-08-03 15:19:58,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:19:58,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:19:58,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:19:58,646 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:19:58,676 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:19:58,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:19:58,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:19:58,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 15:19:58,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:19:58,763 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:19:58,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:19:58,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156026696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:19:58,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:19:58,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 15:19:58,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243734360] [2023-08-03 15:19:58,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:19:58,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:19:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:19:58,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:19:58,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 15:19:58,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 478 [2023-08-03 15:19:58,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 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:19:58,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:19:58,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 478 [2023-08-03 15:19:58,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:19:59,684 INFO L124 PetriNetUnfolderBase]: 9738/15846 cut-off events. [2023-08-03 15:19:59,684 INFO L125 PetriNetUnfolderBase]: For 2664/2664 co-relation queries the response was YES. [2023-08-03 15:19:59,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34376 conditions, 15846 events. 9738/15846 cut-off events. For 2664/2664 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 112866 event pairs, 565 based on Foata normal form. 249/14830 useless extension candidates. Maximal degree in co-relation 34293. Up to 14277 conditions per place. [2023-08-03 15:19:59,753 INFO L140 encePairwiseOnDemand]: 474/478 looper letters, 124 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2023-08-03 15:19:59,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 140 transitions, 744 flow [2023-08-03 15:19:59,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:19:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:19:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1148 transitions. [2023-08-03 15:19:59,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4803347280334728 [2023-08-03 15:19:59,756 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1148 transitions. [2023-08-03 15:19:59,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1148 transitions. [2023-08-03 15:19:59,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:19:59,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1148 transitions. [2023-08-03 15:19:59,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 229.6) internal successors, (1148), 5 states have internal predecessors, (1148), 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:19:59,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 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:19:59,763 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 478.0) internal successors, (2868), 6 states have internal predecessors, (2868), 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:19:59,763 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 5 states and 1148 transitions. [2023-08-03 15:19:59,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 140 transitions, 744 flow [2023-08-03 15:19:59,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 140 transitions, 692 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-03 15:19:59,773 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 327 flow [2023-08-03 15:19:59,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=96, 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=327, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2023-08-03 15:19:59,773 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 34 predicate places. [2023-08-03 15:19:59,773 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 327 flow [2023-08-03 15:19:59,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 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:19:59,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:19:59,774 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:19:59,781 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:19:59,979 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:19:59,979 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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:19:59,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:19:59,980 INFO L85 PathProgramCache]: Analyzing trace with hash -181511658, now seen corresponding path program 1 times [2023-08-03 15:19:59,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:19:59,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278043437] [2023-08-03 15:19:59,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:19:59,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:19:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:00,173 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:20:00,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:20:00,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278043437] [2023-08-03 15:20:00,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278043437] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:20:00,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573836394] [2023-08-03 15:20:00,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:20:00,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:20:00,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:20:00,175 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:20:00,198 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:20:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:20:00,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-03 15:20:00,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:20:00,290 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:20:00,344 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:20:00,345 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:20:00,362 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:20:00,388 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:20:00,426 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:20:00,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:20:08,486 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_340 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_340) |c_~#a~0.base|))) is different from false [2023-08-03 15:20:08,564 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:20:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573836394] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:20:08,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:20:08,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-03 15:20:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600886131] [2023-08-03 15:20:08,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:20:08,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-03 15:20:08,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:20:08,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-03 15:20:08,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=4, NotChecked=18, Total=132 [2023-08-03 15:20:10,574 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:20:12,576 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:20:14,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:20:16,582 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:20:19,101 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:20:21,103 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:20:23,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:20:25,108 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:20:27,111 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:20:29,113 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:20:31,115 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:20:33,571 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:20:35,573 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:20:37,583 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:20:39,588 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:20:41,591 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:20:43,593 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:20:45,596 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:20:47,598 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:20:49,600 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:20:51,606 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:20:54,074 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:20:56,076 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:20:58,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:21:00,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:21:02,097 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:21:04,099 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:21:06,101 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:21:08,103 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:21:10,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:21:12,107 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:21:14,111 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:21:16,113 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:21:18,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:21:20,134 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:21:22,136 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:21:24,138 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:21:26,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:21:26,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 478 [2023-08-03 15:21:26,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 327 flow. Second operand has 12 states, 12 states have (on average 174.75) internal successors, (2097), 12 states have internal predecessors, (2097), 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:21:26,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:21:26,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 478 [2023-08-03 15:21:26,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:21:32,199 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 21 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:21:33,843 INFO L124 PetriNetUnfolderBase]: 11123/18130 cut-off events. [2023-08-03 15:21:33,843 INFO L125 PetriNetUnfolderBase]: For 5650/5650 co-relation queries the response was YES. [2023-08-03 15:21:33,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39832 conditions, 18130 events. 11123/18130 cut-off events. For 5650/5650 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 128305 event pairs, 2095 based on Foata normal form. 0/16882 useless extension candidates. Maximal degree in co-relation 39772. Up to 11821 conditions per place. [2023-08-03 15:21:33,929 INFO L140 encePairwiseOnDemand]: 464/478 looper letters, 158 selfloop transitions, 26 changer transitions 24/219 dead transitions. [2023-08-03 15:21:33,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 219 transitions, 1116 flow [2023-08-03 15:21:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-03 15:21:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-03 15:21:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1566 transitions. [2023-08-03 15:21:33,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40951882845188287 [2023-08-03 15:21:33,934 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1566 transitions. [2023-08-03 15:21:33,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1566 transitions. [2023-08-03 15:21:33,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:21:33,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1566 transitions. [2023-08-03 15:21:33,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 195.75) internal successors, (1566), 8 states have internal predecessors, (1566), 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:21:33,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 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:21:33,944 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 478.0) internal successors, (4302), 9 states have internal predecessors, (4302), 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:21:33,944 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 327 flow. Second operand 8 states and 1566 transitions. [2023-08-03 15:21:33,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 219 transitions, 1116 flow [2023-08-03 15:21:33,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 219 transitions, 1097 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-03 15:21:33,956 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 489 flow [2023-08-03 15:21:33,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=489, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2023-08-03 15:21:33,957 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 44 predicate places. [2023-08-03 15:21:33,957 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 489 flow [2023-08-03 15:21:33,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 174.75) internal successors, (2097), 12 states have internal predecessors, (2097), 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:21:33,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:21:33,958 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:21:33,965 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:21:34,165 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:21:34,166 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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:21:34,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:21:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1396094063, now seen corresponding path program 1 times [2023-08-03 15:21:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:21:34,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535919912] [2023-08-03 15:21:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:21:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:34,230 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:21:34,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:21:34,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535919912] [2023-08-03 15:21:34,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535919912] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:21:34,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423301773] [2023-08-03 15:21:34,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:34,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:21:34,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:21:34,233 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:21:34,266 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:21:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:34,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 15:21:34,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:21:34,368 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:21:34,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:21:34,385 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:21:34,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423301773] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:21:34,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:21:34,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 15:21:34,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441977577] [2023-08-03 15:21:34,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:21:34,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:21:34,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:21:34,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:21:34,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:21:34,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 478 [2023-08-03 15:21:34,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 489 flow. Second operand has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 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:21:34,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:21:34,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 478 [2023-08-03 15:21:34,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:21:35,550 INFO L124 PetriNetUnfolderBase]: 10372/16913 cut-off events. [2023-08-03 15:21:35,550 INFO L125 PetriNetUnfolderBase]: For 8908/8908 co-relation queries the response was YES. [2023-08-03 15:21:35,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40166 conditions, 16913 events. 10372/16913 cut-off events. For 8908/8908 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 119391 event pairs, 2345 based on Foata normal form. 16/15993 useless extension candidates. Maximal degree in co-relation 40100. Up to 15152 conditions per place. [2023-08-03 15:21:35,602 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 141 selfloop transitions, 3 changer transitions 0/156 dead transitions. [2023-08-03 15:21:35,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 156 transitions, 947 flow [2023-08-03 15:21:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:21:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:21:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 938 transitions. [2023-08-03 15:21:35,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4905857740585774 [2023-08-03 15:21:35,605 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 938 transitions. [2023-08-03 15:21:35,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 938 transitions. [2023-08-03 15:21:35,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:21:35,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 938 transitions. [2023-08-03 15:21:35,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 234.5) internal successors, (938), 4 states have internal predecessors, (938), 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:21:35,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 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:21:35,610 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 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:21:35,610 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 489 flow. Second operand 4 states and 938 transitions. [2023-08-03 15:21:35,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 156 transitions, 947 flow [2023-08-03 15:21:35,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 156 transitions, 947 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:21:35,627 INFO L231 Difference]: Finished difference. Result has 115 places, 104 transitions, 478 flow [2023-08-03 15:21:35,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=478, PETRI_PLACES=115, PETRI_TRANSITIONS=104} [2023-08-03 15:21:35,627 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 47 predicate places. [2023-08-03 15:21:35,628 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 104 transitions, 478 flow [2023-08-03 15:21:35,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 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:21:35,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:21:35,628 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:21:35,635 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:21:35,833 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,SelfDestructingSolverStorable12 [2023-08-03 15:21:35,833 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:21:35,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:21:35,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1567879692, now seen corresponding path program 1 times [2023-08-03 15:21:35,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:21:35,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362152519] [2023-08-03 15:21:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:21:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:36,036 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:21:36,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:21:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362152519] [2023-08-03 15:21:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362152519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:21:36,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:21:36,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 15:21:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800983042] [2023-08-03 15:21:36,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:21:36,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:21:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:21:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:21:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:21:36,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 478 [2023-08-03 15:21:36,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 104 transitions, 478 flow. Second operand has 5 states, 5 states have (on average 193.4) internal successors, (967), 5 states have internal predecessors, (967), 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:21:36,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:21:36,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 478 [2023-08-03 15:21:36,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:21:36,994 INFO L124 PetriNetUnfolderBase]: 5650/10535 cut-off events. [2023-08-03 15:21:36,994 INFO L125 PetriNetUnfolderBase]: For 7068/7068 co-relation queries the response was YES. [2023-08-03 15:21:37,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26109 conditions, 10535 events. 5650/10535 cut-off events. For 7068/7068 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 80091 event pairs, 2036 based on Foata normal form. 1462/11105 useless extension candidates. Maximal degree in co-relation 26042. Up to 5406 conditions per place. [2023-08-03 15:21:37,041 INFO L140 encePairwiseOnDemand]: 457/478 looper letters, 135 selfloop transitions, 21 changer transitions 3/168 dead transitions. [2023-08-03 15:21:37,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 168 transitions, 1081 flow [2023-08-03 15:21:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 15:21:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 15:21:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 874 transitions. [2023-08-03 15:21:37,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4571129707112971 [2023-08-03 15:21:37,043 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 874 transitions. [2023-08-03 15:21:37,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 874 transitions. [2023-08-03 15:21:37,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:21:37,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 874 transitions. [2023-08-03 15:21:37,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 218.5) internal successors, (874), 4 states have internal predecessors, (874), 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:21:37,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 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:21:37,048 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 478.0) internal successors, (2390), 5 states have internal predecessors, (2390), 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:21:37,048 INFO L175 Difference]: Start difference. First operand has 115 places, 104 transitions, 478 flow. Second operand 4 states and 874 transitions. [2023-08-03 15:21:37,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 168 transitions, 1081 flow [2023-08-03 15:21:37,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 168 transitions, 1071 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 15:21:37,065 INFO L231 Difference]: Finished difference. Result has 116 places, 115 transitions, 578 flow [2023-08-03 15:21:37,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=578, PETRI_PLACES=116, PETRI_TRANSITIONS=115} [2023-08-03 15:21:37,067 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 48 predicate places. [2023-08-03 15:21:37,067 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 115 transitions, 578 flow [2023-08-03 15:21:37,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.4) internal successors, (967), 5 states have internal predecessors, (967), 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:21:37,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:21:37,068 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:21:37,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 15:21:37,068 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:21:37,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:21:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash 848996043, now seen corresponding path program 1 times [2023-08-03 15:21:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:21:37,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729583592] [2023-08-03 15:21:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:37,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:21:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:37,389 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:21:37,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:21:37,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729583592] [2023-08-03 15:21:37,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729583592] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:21:37,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419883216] [2023-08-03 15:21:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:37,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:21:37,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:21:37,394 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:21:37,419 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:21:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:37,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:21:37,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:21:37,521 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:21:37,574 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:37,574 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:21:37,591 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:21:37,610 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:21:37,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 13 treesize of output 9 [2023-08-03 15:21:37,674 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:37,675 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 19 treesize of output 11 [2023-08-03 15:21:37,710 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 18 treesize of output 13 [2023-08-03 15:21:37,747 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:21:37,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:21:37,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 15 treesize of output 13 [2023-08-03 15:21:37,832 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 12 treesize of output 8 [2023-08-03 15:21:37,854 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_528 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_528) |c_~#a~0.base|))) is different from false [2023-08-03 15:21:37,927 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:21:37,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419883216] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:21:37,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:21:37,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-03 15:21:37,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237828993] [2023-08-03 15:21:37,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:21:37,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 15:21:37,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:21:37,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 15:21:37,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=190, Unknown=1, NotChecked=28, Total=272 [2023-08-03 15:21:38,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 478 [2023-08-03 15:21:38,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 115 transitions, 578 flow. Second operand has 17 states, 17 states have (on average 154.8235294117647) internal successors, (2632), 17 states have internal predecessors, (2632), 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:21:38,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:21:38,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 478 [2023-08-03 15:21:38,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:21:41,155 INFO L124 PetriNetUnfolderBase]: 10039/18573 cut-off events. [2023-08-03 15:21:41,155 INFO L125 PetriNetUnfolderBase]: For 15363/15391 co-relation queries the response was YES. [2023-08-03 15:21:41,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54140 conditions, 18573 events. 10039/18573 cut-off events. For 15363/15391 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 153749 event pairs, 2122 based on Foata normal form. 98/16985 useless extension candidates. Maximal degree in co-relation 54071. Up to 6854 conditions per place. [2023-08-03 15:21:41,242 INFO L140 encePairwiseOnDemand]: 458/478 looper letters, 397 selfloop transitions, 85 changer transitions 97/587 dead transitions. [2023-08-03 15:21:41,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 587 transitions, 3616 flow [2023-08-03 15:21:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-03 15:21:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-03 15:21:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3696 transitions. [2023-08-03 15:21:41,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682008368200837 [2023-08-03 15:21:41,250 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3696 transitions. [2023-08-03 15:21:41,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3696 transitions. [2023-08-03 15:21:41,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:21:41,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3696 transitions. [2023-08-03 15:21:41,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 176.0) internal successors, (3696), 21 states have internal predecessors, (3696), 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:21:41,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 478.0) internal successors, (10516), 22 states have internal predecessors, (10516), 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:21:41,270 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 478.0) internal successors, (10516), 22 states have internal predecessors, (10516), 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:21:41,270 INFO L175 Difference]: Start difference. First operand has 116 places, 115 transitions, 578 flow. Second operand 21 states and 3696 transitions. [2023-08-03 15:21:41,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 587 transitions, 3616 flow [2023-08-03 15:21:41,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 587 transitions, 3615 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:21:41,314 INFO L231 Difference]: Finished difference. Result has 148 places, 177 transitions, 1317 flow [2023-08-03 15:21:41,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1317, PETRI_PLACES=148, PETRI_TRANSITIONS=177} [2023-08-03 15:21:41,314 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 80 predicate places. [2023-08-03 15:21:41,314 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 177 transitions, 1317 flow [2023-08-03 15:21:41,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 154.8235294117647) internal successors, (2632), 17 states have internal predecessors, (2632), 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:21:41,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:21:41,315 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:21:41,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-03 15:21:41,519 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:21:41,519 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:21:41,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:21:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1371644635, now seen corresponding path program 2 times [2023-08-03 15:21:41,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:21:41,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162323160] [2023-08-03 15:21:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:41,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:21:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:41,985 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:21:41,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:21:41,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162323160] [2023-08-03 15:21:41,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162323160] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:21:41,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830258947] [2023-08-03 15:21:41,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:21:41,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:21:41,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:21:41,989 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:21:42,003 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:21:42,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:21:42,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:21:42,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 15:21:42,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:21:42,143 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:21:42,224 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:42,224 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:21:42,250 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:21:42,282 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:21:42,319 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 13 treesize of output 9 [2023-08-03 15:21:42,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:21:42,362 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 16 treesize of output 18 [2023-08-03 15:21:42,394 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 18 treesize of output 13 [2023-08-03 15:21:42,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:21:42,422 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 16 treesize of output 18 [2023-08-03 15:21:42,460 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:42,460 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 19 treesize of output 11 [2023-08-03 15:21:42,495 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:21:42,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:21:42,526 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_66| Int) (v_ArrVal_619 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_619) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_66|)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_66|) 0))) is different from false [2023-08-03 15:21:42,600 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:21:42,600 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 23 treesize of output 24 [2023-08-03 15:21:42,609 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:21:42,609 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 39 treesize of output 35 [2023-08-03 15:21:42,613 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 22 treesize of output 18 [2023-08-03 15:21:44,661 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_613 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_613) |c_~#a~0.base|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 15:21:46,487 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:21:46,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830258947] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:21:46,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:21:46,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-03 15:21:46,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568790593] [2023-08-03 15:21:46,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:21:46,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 15:21:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:21:46,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 15:21:46,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=255, Unknown=2, NotChecked=70, Total=420 [2023-08-03 15:21:46,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 478 [2023-08-03 15:21:46,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 177 transitions, 1317 flow. Second operand has 21 states, 21 states have (on average 153.42857142857142) internal successors, (3222), 21 states have internal predecessors, (3222), 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:21:46,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:21:46,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 478 [2023-08-03 15:21:46,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:21:48,791 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:21:50,793 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:21:53,252 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:21:55,254 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:21:55,607 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_66| Int) (v_ArrVal_618 Int) (v_ArrVal_619 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_618)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_66|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_619) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_66|)) 0)))) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-03 15:21:58,107 INFO L124 PetriNetUnfolderBase]: 12268/22638 cut-off events. [2023-08-03 15:21:58,107 INFO L125 PetriNetUnfolderBase]: For 58703/58747 co-relation queries the response was YES. [2023-08-03 15:21:58,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80861 conditions, 22638 events. 12268/22638 cut-off events. For 58703/58747 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 194186 event pairs, 1462 based on Foata normal form. 52/20662 useless extension candidates. Maximal degree in co-relation 80778. Up to 9324 conditions per place. [2023-08-03 15:21:58,248 INFO L140 encePairwiseOnDemand]: 453/478 looper letters, 353 selfloop transitions, 147 changer transitions 157/665 dead transitions. [2023-08-03 15:21:58,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 665 transitions, 5303 flow [2023-08-03 15:21:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-03 15:21:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-03 15:21:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3981 transitions. [2023-08-03 15:21:58,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3621066036019647 [2023-08-03 15:21:58,257 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3981 transitions. [2023-08-03 15:21:58,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3981 transitions. [2023-08-03 15:21:58,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:21:58,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3981 transitions. [2023-08-03 15:21:58,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 173.08695652173913) internal successors, (3981), 23 states have internal predecessors, (3981), 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:21:58,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 478.0) internal successors, (11472), 24 states have internal predecessors, (11472), 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:21:58,276 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 478.0) internal successors, (11472), 24 states have internal predecessors, (11472), 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:21:58,276 INFO L175 Difference]: Start difference. First operand has 148 places, 177 transitions, 1317 flow. Second operand 23 states and 3981 transitions. [2023-08-03 15:21:58,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 665 transitions, 5303 flow [2023-08-03 15:21:58,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 665 transitions, 5217 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-03 15:21:58,719 INFO L231 Difference]: Finished difference. Result has 181 places, 261 transitions, 2600 flow [2023-08-03 15:21:58,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2600, PETRI_PLACES=181, PETRI_TRANSITIONS=261} [2023-08-03 15:21:58,720 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 113 predicate places. [2023-08-03 15:21:58,720 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 261 transitions, 2600 flow [2023-08-03 15:21:58,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 153.42857142857142) internal successors, (3222), 21 states have internal predecessors, (3222), 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:21:58,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:21:58,721 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:21:58,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-03 15:21:58,925 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:21:58,926 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:21:58,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:21:58,926 INFO L85 PathProgramCache]: Analyzing trace with hash 713534929, now seen corresponding path program 1 times [2023-08-03 15:21:58,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:21:58,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401345109] [2023-08-03 15:21:58,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:58,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:21:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:59,281 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:21:59,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:21:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401345109] [2023-08-03 15:21:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401345109] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:21:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229939334] [2023-08-03 15:21:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:21:59,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:21:59,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:21:59,285 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:21:59,289 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:21:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:21:59,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:21:59,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:21:59,421 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:21:59,466 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:59,467 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:21:59,486 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:21:59,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:21:59,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 13 treesize of output 9 [2023-08-03 15:21:59,567 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:21:59,567 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 19 treesize of output 11 [2023-08-03 15:21:59,610 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 18 treesize of output 13 [2023-08-03 15:21:59,641 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:21:59,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:21:59,706 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 15 treesize of output 13 [2023-08-03 15:21:59,710 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 12 treesize of output 8 [2023-08-03 15:22:05,818 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:22:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229939334] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:22:05,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:22:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-03 15:22:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930036108] [2023-08-03 15:22:05,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:22:05,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 15:22:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:22:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 15:22:05,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=208, Unknown=5, NotChecked=0, Total=272 [2023-08-03 15:22:07,854 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:22:09,934 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:22:11,968 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:22:13,990 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:22:16,058 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:22:18,092 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:22:20,120 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:22:22,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:22:24,170 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:22:26,221 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:22:28,268 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:22:30,301 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:22:32,322 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:22:34,355 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:22:36,407 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:22:38,441 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:22:40,462 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:22:42,497 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:22:44,557 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:22:46,581 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:22:48,601 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:22:50,641 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:22:52,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:22:54,708 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:22:56,791 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:22:58,813 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:23:00,835 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:23:02,888 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:23:04,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 [1] [2023-08-03 15:23:04,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 478 [2023-08-03 15:23:04,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 261 transitions, 2600 flow. Second operand has 17 states, 17 states have (on average 154.88235294117646) internal successors, (2633), 17 states have internal predecessors, (2633), 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:04,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:04,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 478 [2023-08-03 15:23:04,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:08,953 INFO L124 PetriNetUnfolderBase]: 13316/24942 cut-off events. [2023-08-03 15:23:08,953 INFO L125 PetriNetUnfolderBase]: For 120741/120783 co-relation queries the response was YES. [2023-08-03 15:23:09,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109419 conditions, 24942 events. 13316/24942 cut-off events. For 120741/120783 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 220725 event pairs, 3643 based on Foata normal form. 51/22794 useless extension candidates. Maximal degree in co-relation 109321. Up to 14496 conditions per place. [2023-08-03 15:23:09,084 INFO L140 encePairwiseOnDemand]: 459/478 looper letters, 403 selfloop transitions, 90 changer transitions 102/603 dead transitions. [2023-08-03 15:23:09,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 603 transitions, 5786 flow [2023-08-03 15:23:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-03 15:23:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-03 15:23:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2995 transitions. [2023-08-03 15:23:09,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36857002215111984 [2023-08-03 15:23:09,089 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2995 transitions. [2023-08-03 15:23:09,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2995 transitions. [2023-08-03 15:23:09,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:09,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2995 transitions. [2023-08-03 15:23:09,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 176.1764705882353) internal successors, (2995), 17 states have internal predecessors, (2995), 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:09,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 478.0) internal successors, (8604), 18 states have internal predecessors, (8604), 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:09,102 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 478.0) internal successors, (8604), 18 states have internal predecessors, (8604), 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:09,102 INFO L175 Difference]: Start difference. First operand has 181 places, 261 transitions, 2600 flow. Second operand 17 states and 2995 transitions. [2023-08-03 15:23:09,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 603 transitions, 5786 flow [2023-08-03 15:23:10,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 603 transitions, 5590 flow, removed 80 selfloop flow, removed 6 redundant places. [2023-08-03 15:23:10,371 INFO L231 Difference]: Finished difference. Result has 196 places, 272 transitions, 2816 flow [2023-08-03 15:23:10,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2467, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2816, PETRI_PLACES=196, PETRI_TRANSITIONS=272} [2023-08-03 15:23:10,372 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 128 predicate places. [2023-08-03 15:23:10,372 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 272 transitions, 2816 flow [2023-08-03 15:23:10,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 154.88235294117646) internal successors, (2633), 17 states have internal predecessors, (2633), 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:10,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:10,373 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:10,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-03 15:23:10,578 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:23:10,578 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:23:10,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2142959683, now seen corresponding path program 3 times [2023-08-03 15:23:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:10,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534155054] [2023-08-03 15:23:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:11,035 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:11,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:11,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534155054] [2023-08-03 15:23:11,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534155054] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:11,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401151850] [2023-08-03 15:23:11,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 15:23:11,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:11,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:11,042 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:23:11,048 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:23:11,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 15:23:11,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:23:11,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:23:11,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:11,191 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:11,254 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:23:11,254 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:11,278 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:11,303 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:11,330 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 13 treesize of output 9 [2023-08-03 15:23:11,370 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:23:11,370 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 19 treesize of output 11 [2023-08-03 15:23:11,422 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 18 treesize of output 13 [2023-08-03 15:23:11,458 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:11,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:23:11,516 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 15 treesize of output 13 [2023-08-03 15:23:11,520 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 12 treesize of output 8 [2023-08-03 15:23:11,547 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_785 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_785) |c_~#a~0.base|))) is different from false [2023-08-03 15:23:11,620 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:23:11,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401151850] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:23:11,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:23:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2023-08-03 15:23:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353725574] [2023-08-03 15:23:11,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:23:11,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-03 15:23:11,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:11,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-03 15:23:11,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=214, Unknown=1, NotChecked=30, Total=306 [2023-08-03 15:23:11,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 478 [2023-08-03 15:23:11,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 272 transitions, 2816 flow. Second operand has 18 states, 18 states have (on average 152.66666666666666) internal successors, (2748), 18 states have internal predecessors, (2748), 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:11,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:11,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 478 [2023-08-03 15:23:11,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:16,575 INFO L124 PetriNetUnfolderBase]: 15319/28830 cut-off events. [2023-08-03 15:23:16,575 INFO L125 PetriNetUnfolderBase]: For 141930/141998 co-relation queries the response was YES. [2023-08-03 15:23:16,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127201 conditions, 28830 events. 15319/28830 cut-off events. For 141930/141998 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 262007 event pairs, 3275 based on Foata normal form. 52/26349 useless extension candidates. Maximal degree in co-relation 127100. Up to 14327 conditions per place. [2023-08-03 15:23:16,769 INFO L140 encePairwiseOnDemand]: 458/478 looper letters, 403 selfloop transitions, 112 changer transitions 156/679 dead transitions. [2023-08-03 15:23:16,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 679 transitions, 6969 flow [2023-08-03 15:23:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-03 15:23:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-03 15:23:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3433 transitions. [2023-08-03 15:23:16,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35910041841004187 [2023-08-03 15:23:16,773 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3433 transitions. [2023-08-03 15:23:16,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3433 transitions. [2023-08-03 15:23:16,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:23:16,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3433 transitions. [2023-08-03 15:23:16,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 171.65) internal successors, (3433), 20 states have internal predecessors, (3433), 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:16,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 478.0) internal successors, (10038), 21 states have internal predecessors, (10038), 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:16,786 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 478.0) internal successors, (10038), 21 states have internal predecessors, (10038), 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:16,786 INFO L175 Difference]: Start difference. First operand has 196 places, 272 transitions, 2816 flow. Second operand 20 states and 3433 transitions. [2023-08-03 15:23:16,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 679 transitions, 6969 flow [2023-08-03 15:23:18,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 679 transitions, 6740 flow, removed 19 selfloop flow, removed 10 redundant places. [2023-08-03 15:23:18,232 INFO L231 Difference]: Finished difference. Result has 216 places, 298 transitions, 3415 flow [2023-08-03 15:23:18,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=2642, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3415, PETRI_PLACES=216, PETRI_TRANSITIONS=298} [2023-08-03 15:23:18,232 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 148 predicate places. [2023-08-03 15:23:18,232 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 298 transitions, 3415 flow [2023-08-03 15:23:18,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 152.66666666666666) internal successors, (2748), 18 states have internal predecessors, (2748), 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:18,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:23:18,233 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:18,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-03 15:23:18,433 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:23:18,434 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:23:18,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:23:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash -667440623, now seen corresponding path program 2 times [2023-08-03 15:23:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:23:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758574538] [2023-08-03 15:23:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:23:18,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:23:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:23:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:23:22,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:23:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758574538] [2023-08-03 15:23:22,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758574538] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:23:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545721208] [2023-08-03 15:23:22,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:23:22,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:23:22,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:23:22,365 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:23:22,367 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:23:22,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:23:22,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:23:22,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 15:23:22,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:23:22,501 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:22,608 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:23:22,608 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:22,650 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:22,693 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:22,735 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 13 treesize of output 9 [2023-08-03 15:23:22,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:23:22,788 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 16 treesize of output 18 [2023-08-03 15:23:22,844 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:23:22,845 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 19 treesize of output 11 [2023-08-03 15:23:22,882 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 18 treesize of output 13 [2023-08-03 15:23:22,930 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:22,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:23:23,095 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:23:23,095 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 23 treesize of output 24 [2023-08-03 15:23:23,103 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:23:23,103 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 39 treesize of output 35 [2023-08-03 15:23:23,107 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 22 treesize of output 18 [2023-08-03 15:23:37,226 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_874 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_72| Int) (v_ArrVal_870 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_72| v_ArrVal_874) |v_t_funThread1of2ForFork0_~p~0#1.offset_75|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_72|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 15:23:39,717 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:23:39,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545721208] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:23:39,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:23:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 30 [2023-08-03 15:23:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597973838] [2023-08-03 15:23:39,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:23:39,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-03 15:23:39,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:23:39,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-03 15:23:39,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=4, NotChecked=58, Total=992 [2023-08-03 15:23:40,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 478 [2023-08-03 15:23:40,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 298 transitions, 3415 flow. Second operand has 32 states, 32 states have (on average 145.875) internal successors, (4668), 32 states have internal predecessors, (4668), 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,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:23:40,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 478 [2023-08-03 15:23:40,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:23:41,771 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (exists ((v_ArrVal_874 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_874) (select |c_#memory_int| 4)) (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_874 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_873 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_874)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_873) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_75| 4)) 0)))) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-08-03 15:23:41,873 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_874 Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_874)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_874 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_873 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_874)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_873) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_75| 4)) 0)))))) is different from false [2023-08-03 15:23:45,500 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:23:48,046 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:23:50,495 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:23:53,145 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:23:55,258 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:23:57,679 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:24:00,221 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:24:02,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:24:05,168 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:24:07,982 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:24:13,119 INFO L124 PetriNetUnfolderBase]: 18532/35250 cut-off events. [2023-08-03 15:24:13,119 INFO L125 PetriNetUnfolderBase]: For 190735/190839 co-relation queries the response was YES. [2023-08-03 15:24:13,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158640 conditions, 35250 events. 18532/35250 cut-off events. For 190735/190839 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 334295 event pairs, 4602 based on Foata normal form. 122/32297 useless extension candidates. Maximal degree in co-relation 158527. Up to 18360 conditions per place. [2023-08-03 15:24:13,358 INFO L140 encePairwiseOnDemand]: 438/478 looper letters, 508 selfloop transitions, 210 changer transitions 210/936 dead transitions. [2023-08-03 15:24:13,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 936 transitions, 9688 flow [2023-08-03 15:24:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-03 15:24:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-03 15:24:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 6572 transitions. [2023-08-03 15:24:13,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33534034085110725 [2023-08-03 15:24:13,364 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 6572 transitions. [2023-08-03 15:24:13,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 6572 transitions. [2023-08-03 15:24:13,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:24:13,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 6572 transitions. [2023-08-03 15:24:13,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 160.29268292682926) internal successors, (6572), 41 states have internal predecessors, (6572), 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:13,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 478.0) internal successors, (20076), 42 states have internal predecessors, (20076), 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:13,380 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 478.0) internal successors, (20076), 42 states have internal predecessors, (20076), 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:13,380 INFO L175 Difference]: Start difference. First operand has 216 places, 298 transitions, 3415 flow. Second operand 41 states and 6572 transitions. [2023-08-03 15:24:13,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 936 transitions, 9688 flow [2023-08-03 15:24:15,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 936 transitions, 9441 flow, removed 49 selfloop flow, removed 6 redundant places. [2023-08-03 15:24:15,377 INFO L231 Difference]: Finished difference. Result has 260 places, 406 transitions, 5058 flow [2023-08-03 15:24:15,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=3263, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=5058, PETRI_PLACES=260, PETRI_TRANSITIONS=406} [2023-08-03 15:24:15,377 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 192 predicate places. [2023-08-03 15:24:15,377 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 406 transitions, 5058 flow [2023-08-03 15:24:15,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 145.875) internal successors, (4668), 32 states have internal predecessors, (4668), 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:15,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:24:15,378 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:15,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-03 15:24:15,578 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:24:15,579 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:24:15,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:24:15,579 INFO L85 PathProgramCache]: Analyzing trace with hash -597821419, now seen corresponding path program 4 times [2023-08-03 15:24:15,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:24:15,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581703910] [2023-08-03 15:24:15,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:15,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:24:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:24:16,241 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:24:16,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:24:16,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581703910] [2023-08-03 15:24:16,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581703910] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:24:16,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744976526] [2023-08-03 15:24:16,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 15:24:16,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:24:16,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:24:16,243 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:24:16,265 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:24:16,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 15:24:16,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:24:16,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 15:24:16,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:24:16,433 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:16,552 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:24:16,552 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:16,573 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:16,617 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 13 treesize of output 9 [2023-08-03 15:24:16,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:24:16,690 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 16 treesize of output 18 [2023-08-03 15:24:16,718 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 18 treesize of output 13 [2023-08-03 15:24:16,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:24:16,765 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 16 treesize of output 18 [2023-08-03 15:24:16,813 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 16 treesize of output 18 [2023-08-03 15:24:16,866 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:24:16,866 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 19 treesize of output 11 [2023-08-03 15:24:16,904 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:24:16,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:24:16,977 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_74| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_74|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_961) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_74|)) 0)))) is different from false [2023-08-03 15:24:17,067 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:24:17,068 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 23 treesize of output 24 [2023-08-03 15:24:17,076 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:24:17,076 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 39 treesize of output 35 [2023-08-03 15:24:17,091 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 22 treesize of output 18 [2023-08-03 15:24:17,128 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_960 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_74| Int) (v_ArrVal_962 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_960)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_74|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_960 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_74| Int) (v_ArrVal_962 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_74|) (= 0 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_960)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_74|)))))) is different from false [2023-08-03 15:24:17,206 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_960 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_74| Int) (v_ArrVal_962 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_74|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_955))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_960))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_74|) 0))) (or (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_960 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_74| Int) (v_ArrVal_962 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_955))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_960))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_74|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-03 15:24:25,319 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:24:25,489 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:24:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744976526] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:24:25,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:24:25,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-08-03 15:24:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916738694] [2023-08-03 15:24:25,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:24:25,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-03 15:24:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:24:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-03 15:24:25,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=320, Unknown=7, NotChecked=120, Total=552 [2023-08-03 15:24:25,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 478 [2023-08-03 15:24:25,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 406 transitions, 5058 flow. Second operand has 24 states, 24 states have (on average 151.125) internal successors, (3627), 24 states have internal predecessors, (3627), 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:25,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:24:25,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 478 [2023-08-03 15:24:25,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:24:28,010 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:30,013 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:32,019 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:34,610 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:24:34,622 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_74| Int)) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_74|)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_74|) 0))) (forall ((v_ArrVal_960 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_74| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_74|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_961) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_74|)) 0))))) is different from false [2023-08-03 15:24:36,814 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:38,817 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:40,820 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:42,245 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_74| Int) (v_ArrVal_962 (Array Int Int))) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_74|)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_74|) 0))) (forall ((v_ArrVal_960 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_74| Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_960)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_962) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_74|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_961) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_74|)) 0))))) is different from false [2023-08-03 15:24:46,123 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:24:48,962 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:24:53,512 INFO L124 PetriNetUnfolderBase]: 19339/36700 cut-off events. [2023-08-03 15:24:53,512 INFO L125 PetriNetUnfolderBase]: For 346901/347064 co-relation queries the response was YES. [2023-08-03 15:24:53,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210841 conditions, 36700 events. 19339/36700 cut-off events. For 346901/347064 co-relation queries the response was YES. Maximal size of possible extension queue 1574. Compared 349693 event pairs, 3221 based on Foata normal form. 65/33556 useless extension candidates. Maximal degree in co-relation 210705. Up to 19646 conditions per place. [2023-08-03 15:24:54,001 INFO L140 encePairwiseOnDemand]: 449/478 looper letters, 542 selfloop transitions, 273 changer transitions 248/1071 dead transitions. [2023-08-03 15:24:54,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 1071 transitions, 13538 flow [2023-08-03 15:24:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-03 15:24:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-03 15:24:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 5559 transitions. [2023-08-03 15:24:54,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35241536705971854 [2023-08-03 15:24:54,007 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 5559 transitions. [2023-08-03 15:24:54,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 5559 transitions. [2023-08-03 15:24:54,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:24:54,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 5559 transitions. [2023-08-03 15:24:54,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 168.45454545454547) internal successors, (5559), 33 states have internal predecessors, (5559), 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:54,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 478.0) internal successors, (16252), 34 states have internal predecessors, (16252), 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:54,024 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 478.0) internal successors, (16252), 34 states have internal predecessors, (16252), 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:54,024 INFO L175 Difference]: Start difference. First operand has 260 places, 406 transitions, 5058 flow. Second operand 33 states and 5559 transitions. [2023-08-03 15:24:54,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 1071 transitions, 13538 flow [2023-08-03 15:24:56,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1071 transitions, 13117 flow, removed 168 selfloop flow, removed 25 redundant places. [2023-08-03 15:24:56,976 INFO L231 Difference]: Finished difference. Result has 283 places, 517 transitions, 7116 flow [2023-08-03 15:24:56,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=4671, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=7116, PETRI_PLACES=283, PETRI_TRANSITIONS=517} [2023-08-03 15:24:56,977 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 215 predicate places. [2023-08-03 15:24:56,977 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 517 transitions, 7116 flow [2023-08-03 15:24:56,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 151.125) internal successors, (3627), 24 states have internal predecessors, (3627), 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:56,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:24:56,977 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:24:56,982 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:24:57,178 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:24:57,178 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:24:57,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:24:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash 662971049, now seen corresponding path program 1 times [2023-08-03 15:24:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:24:57,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213900486] [2023-08-03 15:24:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:24:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:24:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:25:02,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:25:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213900486] [2023-08-03 15:25:02,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213900486] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:25:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500585480] [2023-08-03 15:25:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:25:02,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:25:02,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:25:02,361 INFO L229 MonitoredProcess]: Starting monitored process 18 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:02,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-03 15:25:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:25:02,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:25:02,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:25:02,480 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:02,565 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:25:02,565 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:02,600 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:02,623 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:02,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 13 treesize of output 9 [2023-08-03 15:25:02,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:25:02,713 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 16 treesize of output 18 [2023-08-03 15:25:02,782 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 15:25:02,783 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 22 treesize of output 15 [2023-08-03 15:25:02,842 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 18 treesize of output 13 [2023-08-03 15:25:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:25:02,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:25:03,167 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:25:03,167 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 26 treesize of output 27 [2023-08-03 15:25:03,176 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:25:03,177 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 45 treesize of output 42 [2023-08-03 15:25:03,181 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:25:19,362 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1047 Int) (|~#a~0.offset| Int) (v_ArrVal_1043 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1043) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1047) .cse0) 0) (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_79|)))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 15:25:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-03 15:25:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500585480] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:25:22,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:25:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 31 [2023-08-03 15:25:22,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173038060] [2023-08-03 15:25:22,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:25:22,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-03 15:25:22,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:25:22,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-03 15:25:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=835, Unknown=5, NotChecked=60, Total=1056 [2023-08-03 15:25:22,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 478 [2023-08-03 15:25:22,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 517 transitions, 7116 flow. Second operand has 33 states, 33 states have (on average 146.0) internal successors, (4818), 33 states have internal predecessors, (4818), 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:22,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:25:22,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 478 [2023-08-03 15:25:22,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:25:33,164 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 46 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:25:49,851 INFO L124 PetriNetUnfolderBase]: 32511/63409 cut-off events. [2023-08-03 15:25:49,851 INFO L125 PetriNetUnfolderBase]: For 828892/829037 co-relation queries the response was YES. [2023-08-03 15:25:50,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411134 conditions, 63409 events. 32511/63409 cut-off events. For 828892/829037 co-relation queries the response was YES. Maximal size of possible extension queue 2629. Compared 667695 event pairs, 6825 based on Foata normal form. 406/58533 useless extension candidates. Maximal degree in co-relation 411009. Up to 25069 conditions per place. [2023-08-03 15:25:50,797 INFO L140 encePairwiseOnDemand]: 458/478 looper letters, 719 selfloop transitions, 382 changer transitions 463/1572 dead transitions. [2023-08-03 15:25:50,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 1572 transitions, 24758 flow [2023-08-03 15:25:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-03 15:25:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-03 15:25:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 6068 transitions. [2023-08-03 15:25:50,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33406738603831754 [2023-08-03 15:25:50,804 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 6068 transitions. [2023-08-03 15:25:50,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 6068 transitions. [2023-08-03 15:25:50,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:25:50,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 6068 transitions. [2023-08-03 15:25:50,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 159.68421052631578) internal successors, (6068), 38 states have internal predecessors, (6068), 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:50,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 478.0) internal successors, (18642), 39 states have internal predecessors, (18642), 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:50,823 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 478.0) internal successors, (18642), 39 states have internal predecessors, (18642), 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:50,823 INFO L175 Difference]: Start difference. First operand has 283 places, 517 transitions, 7116 flow. Second operand 38 states and 6068 transitions. [2023-08-03 15:25:50,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 1572 transitions, 24758 flow [2023-08-03 15:26:05,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 1572 transitions, 22740 flow, removed 734 selfloop flow, removed 16 redundant places. [2023-08-03 15:26:05,264 INFO L231 Difference]: Finished difference. Result has 317 places, 741 transitions, 11400 flow [2023-08-03 15:26:05,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=6356, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=11400, PETRI_PLACES=317, PETRI_TRANSITIONS=741} [2023-08-03 15:26:05,265 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 249 predicate places. [2023-08-03 15:26:05,265 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 741 transitions, 11400 flow [2023-08-03 15:26:05,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 146.0) internal successors, (4818), 33 states have internal predecessors, (4818), 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:05,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:26:05,266 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:26:05,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-03 15:26:05,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:26:05,471 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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:26:05,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:26:05,471 INFO L85 PathProgramCache]: Analyzing trace with hash 410266641, now seen corresponding path program 2 times [2023-08-03 15:26:05,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:26:05,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408503231] [2023-08-03 15:26:05,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:26:05,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:26:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:26:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:26:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:26:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408503231] [2023-08-03 15:26:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408503231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:26:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546126358] [2023-08-03 15:26:05,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:26:05,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:26:05,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:26:05,690 INFO L229 MonitoredProcess]: Starting monitored process 19 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:26:05,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-03 15:26:05,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:26:05,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:26:05,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-03 15:26:05,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:26:05,851 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:26:05,897 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:26:05,898 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:26:05,918 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:26:05,936 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:26:05,962 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:26:05,990 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 15:26:05,991 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 22 treesize of output 15 [2023-08-03 15:26:06,042 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 18 treesize of output 13 [2023-08-03 15:26:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:26:06,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:26:06,141 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 18 treesize of output 16 [2023-08-03 15:26:06,145 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 16 treesize of output 12 [2023-08-03 15:26:16,231 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1132 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1129) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81| v_ArrVal_1132) .cse0) 0) (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_81|)))) is different from false [2023-08-03 15:26:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-03 15:26:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546126358] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:26:16,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:26:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-08-03 15:26:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166055595] [2023-08-03 15:26:16,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:26:16,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 15:26:16,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:26:16,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 15:26:16,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=4, NotChecked=28, Total=272 [2023-08-03 15:26:19,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:26:19,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 478 [2023-08-03 15:26:19,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 741 transitions, 11400 flow. Second operand has 17 states, 17 states have (on average 153.05882352941177) internal successors, (2602), 17 states have internal predecessors, (2602), 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:19,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:26:19,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 478 [2023-08-03 15:26:19,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:26:36,967 INFO L124 PetriNetUnfolderBase]: 34344/69300 cut-off events. [2023-08-03 15:26:36,967 INFO L125 PetriNetUnfolderBase]: For 1080237/1080382 co-relation queries the response was YES. [2023-08-03 15:26:38,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473131 conditions, 69300 events. 34344/69300 cut-off events. For 1080237/1080382 co-relation queries the response was YES. Maximal size of possible extension queue 2691. Compared 762142 event pairs, 11201 based on Foata normal form. 187/63614 useless extension candidates. Maximal degree in co-relation 472984. Up to 33099 conditions per place. [2023-08-03 15:26:38,181 INFO L140 encePairwiseOnDemand]: 459/478 looper letters, 829 selfloop transitions, 285 changer transitions 257/1379 dead transitions. [2023-08-03 15:26:38,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1379 transitions, 23476 flow [2023-08-03 15:26:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-03 15:26:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-03 15:26:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2605 transitions. [2023-08-03 15:26:38,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633193863319386 [2023-08-03 15:26:38,184 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2605 transitions. [2023-08-03 15:26:38,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2605 transitions. [2023-08-03 15:26:38,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:26:38,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2605 transitions. [2023-08-03 15:26:38,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 173.66666666666666) internal successors, (2605), 15 states have internal predecessors, (2605), 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:38,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 478.0) internal successors, (7648), 16 states have internal predecessors, (7648), 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:38,192 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 478.0) internal successors, (7648), 16 states have internal predecessors, (7648), 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:38,192 INFO L175 Difference]: Start difference. First operand has 317 places, 741 transitions, 11400 flow. Second operand 15 states and 2605 transitions. [2023-08-03 15:26:38,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 1379 transitions, 23476 flow [2023-08-03 15:26:50,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 1379 transitions, 23270 flow, removed 84 selfloop flow, removed 13 redundant places. [2023-08-03 15:26:50,153 INFO L231 Difference]: Finished difference. Result has 325 places, 872 transitions, 15107 flow [2023-08-03 15:26:50,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=11266, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=15107, PETRI_PLACES=325, PETRI_TRANSITIONS=872} [2023-08-03 15:26:50,154 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 257 predicate places. [2023-08-03 15:26:50,154 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 872 transitions, 15107 flow [2023-08-03 15:26:50,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 153.05882352941177) internal successors, (2602), 17 states have internal predecessors, (2602), 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:50,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:26:50,155 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:26:50,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-03 15:26:50,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:26:50,355 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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:26:50,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:26:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1693357338, now seen corresponding path program 3 times [2023-08-03 15:26:50,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:26:50,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940121186] [2023-08-03 15:26:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:26:50,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:26:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:26:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:26:50,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:26:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940121186] [2023-08-03 15:26:50,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940121186] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:26:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886168145] [2023-08-03 15:26:50,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 15:26:50,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:26:50,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:26:50,741 INFO L229 MonitoredProcess]: Starting monitored process 20 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:26:50,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-03 15:26:50,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-03 15:26:50,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:26:50,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 15:26:50,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:26:50,892 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:26:51,000 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:26:51,001 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:26:51,021 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:26:51,043 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:26:51,067 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 13 treesize of output 9 [2023-08-03 15:26:51,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:26:51,114 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 16 treesize of output 18 [2023-08-03 15:26:51,140 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:26:51,140 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 19 treesize of output 11 [2023-08-03 15:26:51,168 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 18 treesize of output 13 [2023-08-03 15:26:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:26:51,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:26:51,309 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:26:51,309 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 23 treesize of output 24 [2023-08-03 15:26:51,316 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:26:51,316 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 39 treesize of output 35 [2023-08-03 15:26:51,320 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 22 treesize of output 18 [2023-08-03 15:27:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:27:05,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886168145] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:27:05,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:27:05,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-03 15:27:05,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449810327] [2023-08-03 15:27:05,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:27:05,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 15:27:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:27:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 15:27:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=338, Unknown=7, NotChecked=0, Total=420 [2023-08-03 15:27:07,635 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:09,646 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:11,659 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:13,953 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:15,971 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,056 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:20,087 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:22,106 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,183 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:26,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:27:28,365 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:27:30,976 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:33,067 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:33,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 478 [2023-08-03 15:27:33,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 872 transitions, 15107 flow. Second operand has 21 states, 21 states have (on average 151.47619047619048) internal successors, (3181), 21 states have internal predecessors, (3181), 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:33,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:27:33,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 478 [2023-08-03 15:27:33,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:27:40,280 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, 1] [2023-08-03 15:27:42,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:27:46,280 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, 1] [2023-08-03 15:27:48,289 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, 1] [2023-08-03 15:27:50,292 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, 1] [2023-08-03 15:27:57,505 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:59,517 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:08,439 INFO L124 PetriNetUnfolderBase]: 33837/68287 cut-off events. [2023-08-03 15:28:08,439 INFO L125 PetriNetUnfolderBase]: For 1181501/1181575 co-relation queries the response was YES. [2023-08-03 15:28:09,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480350 conditions, 68287 events. 33837/68287 cut-off events. For 1181501/1181575 co-relation queries the response was YES. Maximal size of possible extension queue 2823. Compared 752946 event pairs, 10743 based on Foata normal form. 87/62396 useless extension candidates. Maximal degree in co-relation 480202. Up to 39296 conditions per place. [2023-08-03 15:28:09,694 INFO L140 encePairwiseOnDemand]: 453/478 looper letters, 840 selfloop transitions, 339 changer transitions 240/1427 dead transitions. [2023-08-03 15:28:09,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1427 transitions, 24751 flow [2023-08-03 15:28:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-03 15:28:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-03 15:28:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4462 transitions. [2023-08-03 15:28:09,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3590280012874155 [2023-08-03 15:28:09,698 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4462 transitions. [2023-08-03 15:28:09,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4462 transitions. [2023-08-03 15:28:09,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:28:09,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4462 transitions. [2023-08-03 15:28:09,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 171.6153846153846) internal successors, (4462), 26 states have internal predecessors, (4462), 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:09,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 478.0) internal successors, (12906), 27 states have internal predecessors, (12906), 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:09,712 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 478.0) internal successors, (12906), 27 states have internal predecessors, (12906), 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:09,712 INFO L175 Difference]: Start difference. First operand has 325 places, 872 transitions, 15107 flow. Second operand 26 states and 4462 transitions. [2023-08-03 15:28:09,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1427 transitions, 24751 flow [2023-08-03 15:28:23,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1427 transitions, 24583 flow, removed 84 selfloop flow, removed 0 redundant places. [2023-08-03 15:28:23,728 INFO L231 Difference]: Finished difference. Result has 360 places, 907 transitions, 16609 flow [2023-08-03 15:28:23,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=15025, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=16609, PETRI_PLACES=360, PETRI_TRANSITIONS=907} [2023-08-03 15:28:23,729 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 292 predicate places. [2023-08-03 15:28:23,729 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 907 transitions, 16609 flow [2023-08-03 15:28:23,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 151.47619047619048) internal successors, (3181), 21 states have internal predecessors, (3181), 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:23,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:28:23,730 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:23,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-03 15:28:23,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:28:23,935 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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:23,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:28:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1343791975, now seen corresponding path program 1 times [2023-08-03 15:28:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:28:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96076857] [2023-08-03 15:28:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:28:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:28:24,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:28:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96076857] [2023-08-03 15:28:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96076857] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:28:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069329760] [2023-08-03 15:28:24,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:28:24,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:28:24,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:28:24,244 INFO L229 MonitoredProcess]: Starting monitored process 21 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:24,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-03 15:28:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:28:24,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-03 15:28:24,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:28:24,416 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:24,465 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:28:24,466 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:24,483 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:24,501 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:24,532 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 13 treesize of output 9 [2023-08-03 15:28:24,572 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 15:28:24,572 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 22 treesize of output 15 [2023-08-03 15:28:24,630 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:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:28:24,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:28:24,735 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 18 treesize of output 16 [2023-08-03 15:28:24,739 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 19 treesize of output 12 [2023-08-03 15:28:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:28:32,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069329760] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:28:32,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:28:32,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-03 15:28:32,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887290185] [2023-08-03 15:28:32,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:28:32,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 15:28:32,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:28:32,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 15:28:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=210, Unknown=1, NotChecked=0, Total=272 [2023-08-03 15:28:34,920 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:37,045 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:39,093 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:41,123 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:43,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:28:45,803 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:47,843 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:49,870 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:28:51,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:28:54,042 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:56,093 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:28:58,116 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:29:00,259 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:29:02,295 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:29:04,392 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:29:06,474 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:29:08,503 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:29:10,531 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:29:12,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:29:14,629 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:29:16,673 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:29:18,760 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:29:20,788 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:29:22,828 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:29:24,860 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:29:26,886 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:29:28,932 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:29:30,978 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:29:30,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 478 [2023-08-03 15:29:30,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 907 transitions, 16609 flow. Second operand has 17 states, 17 states have (on average 152.94117647058823) internal successors, (2600), 17 states have internal predecessors, (2600), 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:29:30,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:29:30,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 478 [2023-08-03 15:29:30,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:29:55,229 INFO L124 PetriNetUnfolderBase]: 34506/70148 cut-off events. [2023-08-03 15:29:55,229 INFO L125 PetriNetUnfolderBase]: For 1451846/1452041 co-relation queries the response was YES. [2023-08-03 15:29:56,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519739 conditions, 70148 events. 34506/70148 cut-off events. For 1451846/1452041 co-relation queries the response was YES. Maximal size of possible extension queue 2829. Compared 782026 event pairs, 11932 based on Foata normal form. 74/64050 useless extension candidates. Maximal degree in co-relation 519579. Up to 46022 conditions per place. [2023-08-03 15:29:56,800 INFO L140 encePairwiseOnDemand]: 458/478 looper letters, 881 selfloop transitions, 258 changer transitions 152/1299 dead transitions. [2023-08-03 15:29:56,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1299 transitions, 24160 flow [2023-08-03 15:29:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-03 15:29:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-03 15:29:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2952 transitions. [2023-08-03 15:29:56,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36327836573960126 [2023-08-03 15:29:56,803 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2952 transitions. [2023-08-03 15:29:56,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2952 transitions. [2023-08-03 15:29:56,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:29:56,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2952 transitions. [2023-08-03 15:29:56,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 173.64705882352942) internal successors, (2952), 17 states have internal predecessors, (2952), 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:29:56,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 478.0) internal successors, (8604), 18 states have internal predecessors, (8604), 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:29:56,812 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 478.0) internal successors, (8604), 18 states have internal predecessors, (8604), 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:29:56,812 INFO L175 Difference]: Start difference. First operand has 360 places, 907 transitions, 16609 flow. Second operand 17 states and 2952 transitions. [2023-08-03 15:29:56,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 1299 transitions, 24160 flow [2023-08-03 15:30:14,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1299 transitions, 23587 flow, removed 103 selfloop flow, removed 13 redundant places. [2023-08-03 15:30:14,505 INFO L231 Difference]: Finished difference. Result has 366 places, 923 transitions, 17351 flow [2023-08-03 15:30:14,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=478, PETRI_DIFFERENCE_MINUEND_FLOW=16126, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=17351, PETRI_PLACES=366, PETRI_TRANSITIONS=923} [2023-08-03 15:30:14,507 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 298 predicate places. [2023-08-03 15:30:14,507 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 923 transitions, 17351 flow [2023-08-03 15:30:14,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 152.94117647058823) internal successors, (2600), 17 states have internal predecessors, (2600), 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:30:14,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:30:14,508 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:30:14,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-03 15:30:14,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-03 15:30:14,713 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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:30:14,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:30:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash 329767513, now seen corresponding path program 2 times [2023-08-03 15:30:14,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:30:14,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565288513] [2023-08-03 15:30:14,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:30:14,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:30:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:30:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 15:30:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:30:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565288513] [2023-08-03 15:30:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565288513] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:30:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687400451] [2023-08-03 15:30:16,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 15:30:16,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:30:16,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:30:16,533 INFO L229 MonitoredProcess]: Starting monitored process 22 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:30:16,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-03 15:30:16,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 15:30:16,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 15:30:16,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 15:30:16,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:30:16,680 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:30:16,761 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 15:30:16,761 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:30:16,790 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:30:16,818 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:30:16,857 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:30:16,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 15:30:16,900 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:30:16,942 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-03 15:30:16,942 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 22 treesize of output 15 [2023-08-03 15:30:16,982 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:30:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-03 15:30:17,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 15:30:17,186 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:30:17,187 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 26 treesize of output 27 [2023-08-03 15:30:17,193 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 15:30:17,194 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 42 treesize of output 39 [2023-08-03 15:30:17,197 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 22 treesize of output 18 [2023-08-03 15:30:41,425 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (|~#a~0.offset| Int) (v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1390 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse0 (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1385) |c_~#a~0.base|) .cse0 v_ArrVal_1390) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (= .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_87|)))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-03 15:30:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-03 15:30:44,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687400451] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 15:30:44,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 15:30:44,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7, 7] total 29 [2023-08-03 15:30:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549439725] [2023-08-03 15:30:44,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 15:30:44,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-03 15:30:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:30:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-03 15:30:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=740, Unknown=18, NotChecked=56, Total=930 [2023-08-03 15:30:44,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 478 [2023-08-03 15:30:44,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 923 transitions, 17351 flow. Second operand has 31 states, 31 states have (on average 146.03225806451613) internal successors, (4527), 31 states have internal predecessors, (4527), 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:30:44,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:30:44,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 478 [2023-08-03 15:30:44,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:31:09,449 WARN L233 SmtUtils]: Spent 24.11s on a formula simplification. DAG size of input: 45 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:31:11,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:31:13,500 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, 1] [2023-08-03 15:31:15,510 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:31:17,552 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:31:37,718 WARN L233 SmtUtils]: Spent 20.11s on a formula simplification. DAG size of input: 39 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 15:31:39,723 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:31:41,729 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:31:43,740 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:31:45,751 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:31:48,361 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:31:50,398 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:31:52,403 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:31:54,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:31:56,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:31:58,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:32:00,431 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:32:02,433 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:32:04,591 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:32:06,596 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:32:08,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:32:10,937 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, 1] [2023-08-03 15:32:13,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:32:15,399 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:32:17,479 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:32:19,415 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|))) (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1388 (Array Int Int)) (v_ArrVal_1390 Int)) (or (= (select (store .cse0 .cse1 v_ArrVal_1390) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1388) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_87| 4)) 0)))) (forall ((v_ArrVal_1390 Int)) (= 0 (select (select (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_1390)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-08-03 15:32:22,119 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:32:24,941 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:32:27,065 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:32:29,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:32:31,394 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:32:33,470 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:32:35,751 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:32:38,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:32:40,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 15:32:42,565 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:32:49,756 WARN L839 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1388 (Array Int Int)) (v_ArrVal_1390 Int)) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|) v_ArrVal_1390) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1388) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_87| 4)) 0))))) is different from false [2023-08-03 15:33:07,927 INFO L124 PetriNetUnfolderBase]: 40448/82233 cut-off events. [2023-08-03 15:33:07,927 INFO L125 PetriNetUnfolderBase]: For 1766942/1767219 co-relation queries the response was YES. [2023-08-03 15:33:09,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607397 conditions, 82233 events. 40448/82233 cut-off events. For 1766942/1767219 co-relation queries the response was YES. Maximal size of possible extension queue 3188. Compared 934538 event pairs, 13566 based on Foata normal form. 167/74893 useless extension candidates. Maximal degree in co-relation 607231. Up to 48137 conditions per place. [2023-08-03 15:33:09,510 INFO L140 encePairwiseOnDemand]: 445/478 looper letters, 1043 selfloop transitions, 481 changer transitions 285/1817 dead transitions. [2023-08-03 15:33:09,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 1817 transitions, 35605 flow [2023-08-03 15:33:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-03 15:33:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-03 15:33:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 6408 transitions. [2023-08-03 15:33:09,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33514644351464434 [2023-08-03 15:33:09,518 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 6408 transitions. [2023-08-03 15:33:09,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 6408 transitions. [2023-08-03 15:33:09,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:33:09,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 6408 transitions. [2023-08-03 15:33:09,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 160.2) internal successors, (6408), 40 states have internal predecessors, (6408), 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:33:09,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 478.0) internal successors, (19598), 41 states have internal predecessors, (19598), 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:33:09,540 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 478.0) internal successors, (19598), 41 states have internal predecessors, (19598), 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:33:09,540 INFO L175 Difference]: Start difference. First operand has 366 places, 923 transitions, 17351 flow. Second operand 40 states and 6408 transitions. [2023-08-03 15:33:09,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 1817 transitions, 35605 flow Received shutdown request... [2023-08-03 15:33:11,259 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 15:33:11,259 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 15:33:11,365 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-03 15:33:11,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-03 15:33:11,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-03 15:33:11,565 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-03 15:33:11,565 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-03 15:33:11,565 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-03 15:33:11,565 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-08-03 15:33:11,566 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-03 15:33:11,566 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 15:33:11,568 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 15:33:11,568 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 15:33:11,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 03:33:11 BasicIcfg [2023-08-03 15:33:11,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 15:33:11,571 INFO L158 Benchmark]: Toolchain (without parser) took 810519.42ms. Allocated memory was 553.6MB in the beginning and 14.0GB in the end (delta: 13.5GB). Free memory was 499.6MB in the beginning and 10.1GB in the end (delta: -9.6GB). Peak memory consumption was 4.5GB. Max. memory is 16.0GB. [2023-08-03 15:33:11,571 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory is still 285.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 15:33:11,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.92ms. Allocated memory is still 553.6MB. Free memory was 499.3MB in the beginning and 469.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-03 15:33:11,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.49ms. Allocated memory is still 553.6MB. Free memory was 469.9MB in the beginning and 466.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 15:33:11,571 INFO L158 Benchmark]: Boogie Preprocessor took 51.92ms. Allocated memory is still 553.6MB. Free memory was 466.9MB in the beginning and 464.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 15:33:11,571 INFO L158 Benchmark]: RCFGBuilder took 518.92ms. Allocated memory is still 553.6MB. Free memory was 464.9MB in the beginning and 506.4MB in the end (delta: -41.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.0GB. [2023-08-03 15:33:11,572 INFO L158 Benchmark]: TraceAbstraction took 809205.70ms. Allocated memory was 553.6MB in the beginning and 14.0GB in the end (delta: 13.5GB). Free memory was 505.3MB in the beginning and 10.1GB in the end (delta: -9.6GB). Peak memory consumption was 4.5GB. Max. memory is 16.0GB. [2023-08-03 15:33:11,572 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory is still 285.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 668.92ms. Allocated memory is still 553.6MB. Free memory was 499.3MB in the beginning and 469.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 68.49ms. Allocated memory is still 553.6MB. Free memory was 469.9MB in the beginning and 466.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.92ms. Allocated memory is still 553.6MB. Free memory was 466.9MB in the beginning and 464.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 518.92ms. Allocated memory is still 553.6MB. Free memory was 464.9MB in the beginning and 506.4MB in the end (delta: -41.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.0GB. * TraceAbstraction took 809205.70ms. Allocated memory was 553.6MB in the beginning and 14.0GB in the end (delta: 13.5GB). Free memory was 505.3MB in the beginning and 10.1GB in the end (delta: -9.6GB). Peak memory consumption was 4.5GB. 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.6s, 158 PlacesBefore, 45 PlacesAfterwards, 185 TransitionsBefore, 65 TransitionsAfterwards, 10336 CoEnabledTransitionPairs, 5 FixpointIterations, 35 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 16 ConcurrentYvCompositions, 7 ChoiceCompositions, 151 TotalNumberOfCompositions, 15158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8146, independent: 7914, independent conditional: 0, independent unconditional: 7914, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5129, independent: 5073, independent conditional: 0, independent unconditional: 5073, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8146, independent: 2841, independent conditional: 0, independent unconditional: 2841, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 5129, unknown conditional: 0, unknown unconditional: 5129] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 201, Positive conditional cache size: 0, Positive unconditional cache size: 201, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 220 PlacesBefore, 68 PlacesAfterwards, 260 TransitionsBefore, 100 TransitionsAfterwards, 31416 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 144 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 26 ConcurrentYvCompositions, 8 ChoiceCompositions, 218 TotalNumberOfCompositions, 55124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24876, independent: 24449, independent conditional: 0, independent unconditional: 24449, dependent: 427, dependent conditional: 0, dependent unconditional: 427, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15412, independent: 15298, independent conditional: 0, independent unconditional: 15298, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 24876, independent: 9151, independent conditional: 0, independent unconditional: 9151, dependent: 313, dependent conditional: 0, dependent unconditional: 313, unknown: 15412, unknown conditional: 0, unknown unconditional: 15412] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 304, Positive conditional cache size: 0, Positive unconditional cache size: 304, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 953]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 216 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: 5.1s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 8 mSDtfsCounter, 505 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=213occurred 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.5s 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, 272 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: 804.0s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 652.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 557 mSolverCounterUnknown, 10990 SdHoareTripleChecker+Valid, 379.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10472 mSDsluCounter, 2757 SdHoareTripleChecker+Invalid, 375.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8480 IncrementalHoareTripleChecker+Unchecked, 2717 mSDsCounter, 1252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32325 IncrementalHoareTripleChecker+Invalid, 42614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1252 mSolverCounterUnsat, 40 mSDtfsCounter, 32325 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1209 GetRequests, 694 SyntacticMatches, 13 SemanticMatches, 502 ConstructedPredicates, 19 IntricatePredicates, 2 DeprecatedPredicates, 4058 ImplicationChecksByTransitivity, 192.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17351occurred in iteration=19, InterpolantAutomatonStates: 302, 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.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 142.2s InterpolantComputationTime, 920 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1269 ConstructedInterpolants, 332 QuantifiedInterpolants, 21378 SizeOfPredicates, 111 NumberOfNonLiveVariables, 3719 ConjunctsInSsa, 458 ConjunctsInUnsatCore, 53 InterpolantComputations, 5 PerfectInterpolantSequences, 2226/2536 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown