/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 21:32:44,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 21:32:44,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 21:32:44,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 21:32:44,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 21:32:44,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 21:32:44,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 21:32:44,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 21:32:44,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 21:32:44,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 21:32:44,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 21:32:44,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 21:32:44,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 21:32:44,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 21:32:44,919 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 21:32:44,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 21:32:44,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 21:32:44,919 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 21:32:44,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 21:32:44,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 21:32:44,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 21:32:44,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 21:32:44,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 21:32:44,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 21:32:44,921 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 21:32:44,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 21:32:44,922 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 21:32:44,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 21:32:44,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 21:32:44,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 21:32:44,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:32:44,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 21:32:44,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 21:32:44,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 21:32:44,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 21:32:44,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 21:32:44,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 21:32:44,924 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 21:32:44,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 21:32:44,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 21:32:44,924 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 21:32:44,924 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 -> INSUFFICIENT_FIRST [2023-08-03 21:32:45,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 21:32:45,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 21:32:45,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 21:32:45,115 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 21:32:45,115 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 21:32:45,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i [2023-08-03 21:32:46,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 21:32:46,264 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 21:32:46,265 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_79-equ_racefree_bound2.i [2023-08-03 21:32:46,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5671ec4/81ebb654608e4c5db9ca16500bc97097/FLAGb7e3561df [2023-08-03 21:32:46,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5671ec4/81ebb654608e4c5db9ca16500bc97097 [2023-08-03 21:32:46,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 21:32:46,292 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 21:32:46,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 21:32:46,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 21:32:46,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 21:32:46,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6fa7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46, skipping insertion in model container [2023-08-03 21:32:46,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,324 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 21:32:46,578 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_79-equ_racefree_bound2.i[47038,47051] [2023-08-03 21:32:46,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:32:46,616 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 21:32:46,635 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 21:32:46,636 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-03 21:32:46,645 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_79-equ_racefree_bound2.i[47038,47051] [2023-08-03 21:32:46,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:32:46,691 INFO L206 MainTranslator]: Completed translation [2023-08-03 21:32:46,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46 WrapperNode [2023-08-03 21:32:46,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 21:32:46,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 21:32:46,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 21:32:46,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 21:32:46,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,724 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 204 [2023-08-03 21:32:46,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 21:32:46,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 21:32:46,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 21:32:46,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 21:32:46,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 21:32:46,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 21:32:46,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 21:32:46,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 21:32:46,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (1/1) ... [2023-08-03 21:32:46,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:32:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:32:46,802 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 21:32:46,809 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 21:32:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 21:32:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 21:32:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 21:32:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 21:32:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-03 21:32:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 21:32:46,832 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-03 21:32:46,832 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-03 21:32:46,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 21:32:46,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 21:32:46,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 21:32:46,834 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 21:32:46,929 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 21:32:46,930 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 21:32:47,204 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 21:32:47,210 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 21:32:47,211 INFO L302 CfgBuilder]: Removed 22 assume(true) statements. [2023-08-03 21:32:47,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:32:47 BoogieIcfgContainer [2023-08-03 21:32:47,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 21:32:47,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 21:32:47,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 21:32:47,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 21:32:47,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 09:32:46" (1/3) ... [2023-08-03 21:32:47,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4801607b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:32:47, skipping insertion in model container [2023-08-03 21:32:47,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:32:46" (2/3) ... [2023-08-03 21:32:47,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4801607b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:32:47, skipping insertion in model container [2023-08-03 21:32:47,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:32:47" (3/3) ... [2023-08-03 21:32:47,218 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_79-equ_racefree_bound2.i [2023-08-03 21:32:47,224 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 21:32:47,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 21:32:47,231 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 21:32:47,231 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 21:32:47,281 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-03 21:32:47,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 201 transitions, 410 flow [2023-08-03 21:32:47,391 INFO L124 PetriNetUnfolderBase]: 43/271 cut-off events. [2023-08-03 21:32:47,391 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-03 21:32:47,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 271 events. 43/271 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 823 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2023-08-03 21:32:47,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 201 transitions, 410 flow [2023-08-03 21:32:47,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 194 transitions, 393 flow [2023-08-03 21:32:47,402 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:32:47,416 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 194 transitions, 393 flow [2023-08-03 21:32:47,419 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 194 transitions, 393 flow [2023-08-03 21:32:47,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 194 transitions, 393 flow [2023-08-03 21:32:47,450 INFO L124 PetriNetUnfolderBase]: 41/264 cut-off events. [2023-08-03 21:32:47,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:32:47,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 264 events. 41/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 803 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2023-08-03 21:32:47,455 INFO L119 LiptonReduction]: Number of co-enabled transitions 8664 [2023-08-03 21:32:53,662 INFO L134 LiptonReduction]: Checked pairs total: 18412 [2023-08-03 21:32:53,662 INFO L136 LiptonReduction]: Total number of compositions: 166 [2023-08-03 21:32:53,684 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:32:53,688 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;@58929947, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:32:53,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:32:53,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:32:53,697 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2023-08-03 21:32:53,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:32:53,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:32:53,698 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 21:32:53,698 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:32:53,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:32:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1260636167, now seen corresponding path program 1 times [2023-08-03 21:32:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:32:53,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085665154] [2023-08-03 21:32:53,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:32:53,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:32:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:32:53,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:32:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:32:53,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:32:53,859 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:32:53,860 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:32:53,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 21:32:53,861 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-03 21:32:53,866 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (1/2) [2023-08-03 21:32:53,866 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 21:32:53,866 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 21:32:53,895 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-03 21:32:53,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 260 transitions, 538 flow [2023-08-03 21:32:53,956 INFO L124 PetriNetUnfolderBase]: 72/424 cut-off events. [2023-08-03 21:32:53,957 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-03 21:32:53,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 72/424 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1596 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 273. Up to 12 conditions per place. [2023-08-03 21:32:53,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 260 transitions, 538 flow [2023-08-03 21:32:53,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 258 transitions, 534 flow [2023-08-03 21:32:53,963 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:32:53,963 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 258 transitions, 534 flow [2023-08-03 21:32:53,964 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 258 transitions, 534 flow [2023-08-03 21:32:53,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 258 transitions, 534 flow [2023-08-03 21:32:53,995 INFO L124 PetriNetUnfolderBase]: 71/422 cut-off events. [2023-08-03 21:32:53,995 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-03 21:32:53,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 422 events. 71/422 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1612 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 271. Up to 12 conditions per place. [2023-08-03 21:32:54,007 INFO L119 LiptonReduction]: Number of co-enabled transitions 25080 [2023-08-03 21:32:59,634 INFO L134 LiptonReduction]: Checked pairs total: 57220 [2023-08-03 21:32:59,634 INFO L136 LiptonReduction]: Total number of compositions: 206 [2023-08-03 21:32:59,637 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 21:32:59,639 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;@58929947, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:32:59,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-03 21:32:59,646 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:32:59,646 INFO L124 PetriNetUnfolderBase]: 37/113 cut-off events. [2023-08-03 21:32:59,646 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-03 21:32:59,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:32:59,647 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 21:32:59,647 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:32:59,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:32:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash -147922955, now seen corresponding path program 1 times [2023-08-03 21:32:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:32:59,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66958985] [2023-08-03 21:32:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:32:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:32:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:32:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:32:59,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:32:59,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66958985] [2023-08-03 21:32:59,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66958985] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:32:59,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732590282] [2023-08-03 21:32:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:32:59,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:32:59,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:32:59,863 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 21:32:59,892 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 21:32:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:32:59,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:32:59,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:33:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:33:00,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:33:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:33:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732590282] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 21:33:00,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 21:33:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2023-08-03 21:33:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118038848] [2023-08-03 21:33:00,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:33:00,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:33:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:00,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:33:00,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:33:00,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 466 [2023-08-03 21:33:00,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 98 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states 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 21:33:00,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:00,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 466 [2023-08-03 21:33:00,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:01,181 INFO L124 PetriNetUnfolderBase]: 8009/13561 cut-off events. [2023-08-03 21:33:01,181 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-03 21:33:01,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25829 conditions, 13561 events. 8009/13561 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 105115 event pairs, 0 based on Foata normal form. 3221/14882 useless extension candidates. Maximal degree in co-relation 2205. Up to 11645 conditions per place. [2023-08-03 21:33:01,202 INFO L140 encePairwiseOnDemand]: 431/466 looper letters, 0 selfloop transitions, 0 changer transitions 113/113 dead transitions. [2023-08-03 21:33:01,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 113 transitions, 438 flow [2023-08-03 21:33:01,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:33:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:33:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1226 transitions. [2023-08-03 21:33:01,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261802575107296 [2023-08-03 21:33:01,214 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1226 transitions. [2023-08-03 21:33:01,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1226 transitions. [2023-08-03 21:33:01,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:01,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1226 transitions. [2023-08-03 21:33:01,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 245.2) internal successors, (1226), 5 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states 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 21:33:01,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states 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 21:33:01,228 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states 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 21:33:01,229 INFO L175 Difference]: Start difference. First operand has 67 places, 98 transitions, 214 flow. Second operand 5 states and 1226 transitions. [2023-08-03 21:33:01,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 113 transitions, 438 flow [2023-08-03 21:33:01,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 113 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 21:33:01,234 INFO L231 Difference]: Finished difference. Result has 68 places, 0 transitions, 0 flow [2023-08-03 21:33:01,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=68, PETRI_TRANSITIONS=0} [2023-08-03 21:33:01,237 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 1 predicate places. [2023-08-03 21:33:01,237 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 0 transitions, 0 flow [2023-08-03 21:33:01,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states 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 21:33:01,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-03 21:33:01,245 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 21:33:01,442 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 21:33:01,442 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-03 21:33:01,443 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE (1/2) [2023-08-03 21:33:01,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 260 transitions, 538 flow [2023-08-03 21:33:01,468 INFO L124 PetriNetUnfolderBase]: 72/424 cut-off events. [2023-08-03 21:33:01,468 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-03 21:33:01,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 72/424 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1596 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 273. Up to 12 conditions per place. [2023-08-03 21:33:01,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 260 transitions, 538 flow [2023-08-03 21:33:01,471 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 258 transitions, 534 flow [2023-08-03 21:33:01,471 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:33:01,471 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 258 transitions, 534 flow [2023-08-03 21:33:01,472 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 258 transitions, 534 flow [2023-08-03 21:33:01,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 258 transitions, 534 flow [2023-08-03 21:33:01,493 INFO L124 PetriNetUnfolderBase]: 71/422 cut-off events. [2023-08-03 21:33:01,493 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-03 21:33:01,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 422 events. 71/422 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1612 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 271. Up to 12 conditions per place. [2023-08-03 21:33:01,501 INFO L119 LiptonReduction]: Number of co-enabled transitions 25080 [2023-08-03 21:33:06,567 INFO L134 LiptonReduction]: Checked pairs total: 57214 [2023-08-03 21:33:06,567 INFO L136 LiptonReduction]: Total number of compositions: 206 [2023-08-03 21:33:06,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:33:06,568 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;@58929947, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:33:06,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 21:33:06,570 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:33:06,570 INFO L124 PetriNetUnfolderBase]: 7/26 cut-off events. [2023-08-03 21:33:06,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:33:06,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:06,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 21:33:06,571 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:06,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1431016033, now seen corresponding path program 1 times [2023-08-03 21:33:06,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:06,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075921301] [2023-08-03 21:33:06,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:06,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:06,625 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 21:33:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075921301] [2023-08-03 21:33:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075921301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:33:06,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:33:06,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:33:06,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896194223] [2023-08-03 21:33:06,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:33:06,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:33:06,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:06,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:33:06,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:33:06,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 466 [2023-08-03 21:33:06,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 98 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states 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 21:33:06,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:06,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 466 [2023-08-03 21:33:06,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:07,327 INFO L124 PetriNetUnfolderBase]: 8903/13936 cut-off events. [2023-08-03 21:33:07,328 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-08-03 21:33:07,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26898 conditions, 13936 events. 8903/13936 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 93286 event pairs, 6020 based on Foata normal form. 3325/15003 useless extension candidates. Maximal degree in co-relation 11579. Up to 12844 conditions per place. [2023-08-03 21:33:07,386 INFO L140 encePairwiseOnDemand]: 432/466 looper letters, 66 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-03 21:33:07,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 320 flow [2023-08-03 21:33:07,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:33:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:33:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2023-08-03 21:33:07,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5379113018597997 [2023-08-03 21:33:07,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2023-08-03 21:33:07,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2023-08-03 21:33:07,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:07,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2023-08-03 21:33:07,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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 21:33:07,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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 21:33:07,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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 21:33:07,393 INFO L175 Difference]: Start difference. First operand has 67 places, 98 transitions, 214 flow. Second operand 3 states and 752 transitions. [2023-08-03 21:33:07,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 320 flow [2023-08-03 21:33:07,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 320 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:33:07,397 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 164 flow [2023-08-03 21:33:07,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2023-08-03 21:33:07,399 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 3 predicate places. [2023-08-03 21:33:07,399 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 164 flow [2023-08-03 21:33:07,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states 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 21:33:07,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:07,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:33:07,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 21:33:07,399 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:07,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash 485087152, now seen corresponding path program 1 times [2023-08-03 21:33:07,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486201628] [2023-08-03 21:33:07,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:07,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:07,540 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 21:33:07,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:07,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486201628] [2023-08-03 21:33:07,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486201628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:33:07,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:33:07,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:33:07,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84542397] [2023-08-03 21:33:07,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:33:07,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:33:07,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:07,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:33:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:33:07,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 466 [2023-08-03 21:33:07,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 207.5) internal successors, (830), 4 states have internal predecessors, (830), 0 states have call successors, (0), 0 states 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 21:33:07,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:07,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 466 [2023-08-03 21:33:07,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:08,492 INFO L124 PetriNetUnfolderBase]: 10896/17643 cut-off events. [2023-08-03 21:33:08,493 INFO L125 PetriNetUnfolderBase]: For 752/752 co-relation queries the response was YES. [2023-08-03 21:33:08,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35086 conditions, 17643 events. 10896/17643 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 128370 event pairs, 3240 based on Foata normal form. 0/15451 useless extension candidates. Maximal degree in co-relation 34978. Up to 10915 conditions per place. [2023-08-03 21:33:08,554 INFO L140 encePairwiseOnDemand]: 453/466 looper letters, 116 selfloop transitions, 12 changer transitions 7/150 dead transitions. [2023-08-03 21:33:08,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 626 flow [2023-08-03 21:33:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:33:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:33:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 961 transitions. [2023-08-03 21:33:08,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155579399141631 [2023-08-03 21:33:08,556 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 961 transitions. [2023-08-03 21:33:08,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 961 transitions. [2023-08-03 21:33:08,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:08,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 961 transitions. [2023-08-03 21:33:08,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 240.25) internal successors, (961), 4 states have internal predecessors, (961), 0 states have call successors, (0), 0 states 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 21:33:08,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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 21:33:08,561 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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 21:33:08,561 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 164 flow. Second operand 4 states and 961 transitions. [2023-08-03 21:33:08,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 626 flow [2023-08-03 21:33:08,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 150 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:33:08,564 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 262 flow [2023-08-03 21:33:08,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2023-08-03 21:33:08,565 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2023-08-03 21:33:08,565 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 262 flow [2023-08-03 21:33:08,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 207.5) internal successors, (830), 4 states have internal predecessors, (830), 0 states have call successors, (0), 0 states 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 21:33:08,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:08,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:33:08,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 21:33:08,566 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:08,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash -702947631, now seen corresponding path program 1 times [2023-08-03 21:33:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305924536] [2023-08-03 21:33:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:08,605 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 21:33:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305924536] [2023-08-03 21:33:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305924536] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:33:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029677104] [2023-08-03 21:33:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:08,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:08,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:33:08,607 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 21:33:08,644 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 21:33:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:08,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:33:08,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:33:08,945 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 21:33:08,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:33:08,954 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 21:33:08,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029677104] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:33:08,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:33:08,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 21:33:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4264055] [2023-08-03 21:33:08,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:33:08,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:33:08,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:08,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:33:08,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:33:08,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 466 [2023-08-03 21:33:08,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 262 flow. Second operand has 5 states, 5 states have (on average 215.2) internal successors, (1076), 5 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states 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 21:33:08,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:08,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 466 [2023-08-03 21:33:08,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:09,788 INFO L124 PetriNetUnfolderBase]: 10606/17915 cut-off events. [2023-08-03 21:33:09,788 INFO L125 PetriNetUnfolderBase]: For 5060/5060 co-relation queries the response was YES. [2023-08-03 21:33:09,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40302 conditions, 17915 events. 10606/17915 cut-off events. For 5060/5060 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 137959 event pairs, 800 based on Foata normal form. 15/16692 useless extension candidates. Maximal degree in co-relation 8700. Up to 14947 conditions per place. [2023-08-03 21:33:09,969 INFO L140 encePairwiseOnDemand]: 462/466 looper letters, 110 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2023-08-03 21:33:09,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 129 transitions, 646 flow [2023-08-03 21:33:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:33:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:33:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 950 transitions. [2023-08-03 21:33:09,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509656652360515 [2023-08-03 21:33:09,971 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 950 transitions. [2023-08-03 21:33:09,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 950 transitions. [2023-08-03 21:33:09,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:09,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 950 transitions. [2023-08-03 21:33:09,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 237.5) internal successors, (950), 4 states have internal predecessors, (950), 0 states have call successors, (0), 0 states 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 21:33:09,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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 21:33:09,976 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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 21:33:09,976 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 262 flow. Second operand 4 states and 950 transitions. [2023-08-03 21:33:09,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 129 transitions, 646 flow [2023-08-03 21:33:09,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:33:09,982 INFO L231 Difference]: Finished difference. Result has 80 places, 80 transitions, 284 flow [2023-08-03 21:33:09,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=80, PETRI_TRANSITIONS=80} [2023-08-03 21:33:09,983 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 13 predicate places. [2023-08-03 21:33:09,984 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 284 flow [2023-08-03 21:33:09,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 215.2) internal successors, (1076), 5 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states 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 21:33:09,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:09,985 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:33:10,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 21:33:10,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:10,189 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:10,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1443713406, now seen corresponding path program 1 times [2023-08-03 21:33:10,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:10,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241740911] [2023-08-03 21:33:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:10,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:33:10,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:10,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241740911] [2023-08-03 21:33:10,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241740911] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:33:10,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574145128] [2023-08-03 21:33:10,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:10,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:10,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:33:10,631 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 21:33:10,678 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 21:33:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:10,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-03 21:33:10,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:33:10,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:10,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:10,961 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:33:10,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:33:11,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:11,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:11,041 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:33:11,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:33:11,331 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:33:11,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 382 treesize of output 309 [2023-08-03 21:33:12,134 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:33:12,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 382 treesize of output 309 [2023-08-03 21:33:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:33:13,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:33:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:33:13,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574145128] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:33:13,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:33:13,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2023-08-03 21:33:13,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209269356] [2023-08-03 21:33:13,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:33:13,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-03 21:33:13,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:13,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-03 21:33:13,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=1, NotChecked=0, Total=56 [2023-08-03 21:33:13,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 466 [2023-08-03 21:33:13,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 284 flow. Second operand has 8 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 21:33:13,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:13,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 466 [2023-08-03 21:33:13,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:14,837 INFO L124 PetriNetUnfolderBase]: 12368/20379 cut-off events. [2023-08-03 21:33:14,837 INFO L125 PetriNetUnfolderBase]: For 9491/9509 co-relation queries the response was YES. [2023-08-03 21:33:14,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47919 conditions, 20379 events. 12368/20379 cut-off events. For 9491/9509 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 153513 event pairs, 4252 based on Foata normal form. 6/19098 useless extension candidates. Maximal degree in co-relation 22463. Up to 13637 conditions per place. [2023-08-03 21:33:14,914 INFO L140 encePairwiseOnDemand]: 457/466 looper letters, 118 selfloop transitions, 10 changer transitions 23/166 dead transitions. [2023-08-03 21:33:14,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 166 transitions, 850 flow [2023-08-03 21:33:14,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:33:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:33:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1099 transitions. [2023-08-03 21:33:14,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716738197424893 [2023-08-03 21:33:14,917 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1099 transitions. [2023-08-03 21:33:14,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1099 transitions. [2023-08-03 21:33:14,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:14,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1099 transitions. [2023-08-03 21:33:14,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 219.8) internal successors, (1099), 5 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states 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 21:33:14,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states 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 21:33:14,923 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states 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 21:33:14,923 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 284 flow. Second operand 5 states and 1099 transitions. [2023-08-03 21:33:14,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 166 transitions, 850 flow [2023-08-03 21:33:14,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 166 transitions, 843 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-03 21:33:14,929 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 343 flow [2023-08-03 21:33:14,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2023-08-03 21:33:14,930 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 19 predicate places. [2023-08-03 21:33:14,930 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 343 flow [2023-08-03 21:33:14,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 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 21:33:14,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:14,931 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:33:14,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-03 21:33:15,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:15,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:15,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1218342449, now seen corresponding path program 1 times [2023-08-03 21:33:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407493203] [2023-08-03 21:33:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:33:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:15,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407493203] [2023-08-03 21:33:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407493203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:33:15,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:33:15,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:33:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320964544] [2023-08-03 21:33:15,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:33:15,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:33:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:15,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:33:15,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:33:15,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 466 [2023-08-03 21:33:15,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 343 flow. Second operand has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states 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 21:33:15,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:15,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 466 [2023-08-03 21:33:15,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:17,474 INFO L124 PetriNetUnfolderBase]: 20637/35147 cut-off events. [2023-08-03 21:33:17,475 INFO L125 PetriNetUnfolderBase]: For 20531/20531 co-relation queries the response was YES. [2023-08-03 21:33:17,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85569 conditions, 35147 events. 20637/35147 cut-off events. For 20531/20531 co-relation queries the response was YES. Maximal size of possible extension queue 1383. Compared 297872 event pairs, 6315 based on Foata normal form. 1753/34716 useless extension candidates. Maximal degree in co-relation 80636. Up to 18386 conditions per place. [2023-08-03 21:33:17,613 INFO L140 encePairwiseOnDemand]: 443/466 looper letters, 180 selfloop transitions, 19 changer transitions 0/208 dead transitions. [2023-08-03 21:33:17,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 208 transitions, 1276 flow [2023-08-03 21:33:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:33:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:33:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 928 transitions. [2023-08-03 21:33:17,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978540772532189 [2023-08-03 21:33:17,616 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 928 transitions. [2023-08-03 21:33:17,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 928 transitions. [2023-08-03 21:33:17,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:17,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 928 transitions. [2023-08-03 21:33:17,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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 21:33:17,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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 21:33:17,621 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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 21:33:17,621 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 343 flow. Second operand 4 states and 928 transitions. [2023-08-03 21:33:17,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 208 transitions, 1276 flow [2023-08-03 21:33:17,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 208 transitions, 1263 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:33:17,640 INFO L231 Difference]: Finished difference. Result has 89 places, 100 transitions, 466 flow [2023-08-03 21:33:17,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=89, PETRI_TRANSITIONS=100} [2023-08-03 21:33:17,641 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 22 predicate places. [2023-08-03 21:33:17,642 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 466 flow [2023-08-03 21:33:17,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states 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 21:33:17,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:17,642 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:33:17,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 21:33:17,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:17,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1704391349, now seen corresponding path program 1 times [2023-08-03 21:33:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:17,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878752669] [2023-08-03 21:33:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:33:17,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:17,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878752669] [2023-08-03 21:33:17,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878752669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:33:17,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:33:17,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:33:17,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79248686] [2023-08-03 21:33:17,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:33:17,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:33:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:33:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:33:17,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 466 [2023-08-03 21:33:17,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 466 flow. Second operand has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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 21:33:17,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:17,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 466 [2023-08-03 21:33:17,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:18,659 INFO L124 PetriNetUnfolderBase]: 5054/10010 cut-off events. [2023-08-03 21:33:18,660 INFO L125 PetriNetUnfolderBase]: For 9473/9586 co-relation queries the response was YES. [2023-08-03 21:33:18,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27940 conditions, 10010 events. 5054/10010 cut-off events. For 9473/9586 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 84097 event pairs, 1947 based on Foata normal form. 692/10049 useless extension candidates. Maximal degree in co-relation 22988. Up to 6261 conditions per place. [2023-08-03 21:33:18,778 INFO L140 encePairwiseOnDemand]: 460/466 looper letters, 119 selfloop transitions, 6 changer transitions 7/147 dead transitions. [2023-08-03 21:33:18,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 147 transitions, 960 flow [2023-08-03 21:33:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:33:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:33:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 938 transitions. [2023-08-03 21:33:18,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032188841201717 [2023-08-03 21:33:18,781 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 938 transitions. [2023-08-03 21:33:18,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 938 transitions. [2023-08-03 21:33:18,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:18,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 938 transitions. [2023-08-03 21:33:18,783 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 21:33:18,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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 21:33:18,785 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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 21:33:18,785 INFO L175 Difference]: Start difference. First operand has 89 places, 100 transitions, 466 flow. Second operand 4 states and 938 transitions. [2023-08-03 21:33:18,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 147 transitions, 960 flow [2023-08-03 21:33:18,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 147 transitions, 960 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:33:18,791 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 392 flow [2023-08-03 21:33:18,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2023-08-03 21:33:18,792 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 24 predicate places. [2023-08-03 21:33:18,792 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 392 flow [2023-08-03 21:33:18,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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 21:33:18,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:18,792 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:33:18,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 21:33:18,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:18,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1661106635, now seen corresponding path program 1 times [2023-08-03 21:33:18,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:18,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190382264] [2023-08-03 21:33:18,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:18,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 21:33:18,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:18,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190382264] [2023-08-03 21:33:18,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190382264] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:33:18,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:33:18,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:33:18,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783142018] [2023-08-03 21:33:18,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:33:18,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:33:18,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:18,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:33:18,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:33:18,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 466 [2023-08-03 21:33:18,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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 21:33:18,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:18,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 466 [2023-08-03 21:33:18,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:19,682 INFO L124 PetriNetUnfolderBase]: 6104/12080 cut-off events. [2023-08-03 21:33:19,682 INFO L125 PetriNetUnfolderBase]: For 11534/11550 co-relation queries the response was YES. [2023-08-03 21:33:19,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35850 conditions, 12080 events. 6104/12080 cut-off events. For 11534/11550 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 101894 event pairs, 2190 based on Foata normal form. 518/11978 useless extension candidates. Maximal degree in co-relation 21599. Up to 6231 conditions per place. [2023-08-03 21:33:19,721 INFO L140 encePairwiseOnDemand]: 445/466 looper letters, 112 selfloop transitions, 21 changer transitions 3/145 dead transitions. [2023-08-03 21:33:19,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 145 transitions, 966 flow [2023-08-03 21:33:19,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:33:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:33:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2023-08-03 21:33:19,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978540772532189 [2023-08-03 21:33:19,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 696 transitions. [2023-08-03 21:33:19,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 696 transitions. [2023-08-03 21:33:19,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:19,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 696 transitions. [2023-08-03 21:33:19,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 21:33:19,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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 21:33:19,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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 21:33:19,726 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 392 flow. Second operand 3 states and 696 transitions. [2023-08-03 21:33:19,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 145 transitions, 966 flow [2023-08-03 21:33:19,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 145 transitions, 955 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 21:33:19,735 INFO L231 Difference]: Finished difference. Result has 92 places, 96 transitions, 524 flow [2023-08-03 21:33:19,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=92, PETRI_TRANSITIONS=96} [2023-08-03 21:33:19,735 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 25 predicate places. [2023-08-03 21:33:19,735 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 96 transitions, 524 flow [2023-08-03 21:33:19,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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 21:33:19,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:19,736 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:33:19,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 21:33:19,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:19,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:19,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1248584561, now seen corresponding path program 1 times [2023-08-03 21:33:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:19,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550797271] [2023-08-03 21:33:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:33:20,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550797271] [2023-08-03 21:33:20,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550797271] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:33:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373126555] [2023-08-03 21:33:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:20,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:33:20,257 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 21:33:20,301 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 21:33:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:20,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-03 21:33:20,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:33:20,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:20,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:20,677 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:33:20,677 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:33:20,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:33:20,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:20,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:20,789 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:33:20,789 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:33:20,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:33:21,249 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:33:21,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 412 treesize of output 339 [2023-08-03 21:33:22,477 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:33:22,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 412 treesize of output 339 [2023-08-03 21:33:22,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 13 treesize of output 9 [2023-08-03 21:33:23,692 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-03 21:33:23,692 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 1 case distinctions, treesize of input 382 treesize of output 382 [2023-08-03 21:33:24,203 INFO L322 Elim1Store]: treesize reduction 61, result has 20.8 percent of original size [2023-08-03 21:33:24,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 382 treesize of output 304 [2023-08-03 21:33:24,504 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-03 21:33:24,505 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 1 case distinctions, treesize of input 264 treesize of output 264 [2023-08-03 21:33:24,982 INFO L322 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-08-03 21:33:24,982 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 259 treesize of output 251 [2023-08-03 21:33:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:33:25,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:33:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:33:25,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373126555] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:33:25,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:33:25,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2023-08-03 21:33:25,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885790086] [2023-08-03 21:33:25,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:33:25,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-03 21:33:25,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:25,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-03 21:33:25,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=239, Unknown=15, NotChecked=0, Total=342 [2023-08-03 21:33:25,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 466 [2023-08-03 21:33:25,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 96 transitions, 524 flow. Second operand has 19 states, 19 states have (on average 143.68421052631578) internal successors, (2730), 19 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states 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 21:33:25,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:25,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 466 [2023-08-03 21:33:25,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:31,376 INFO L124 PetriNetUnfolderBase]: 9133/18842 cut-off events. [2023-08-03 21:33:31,377 INFO L125 PetriNetUnfolderBase]: For 26113/26125 co-relation queries the response was YES. [2023-08-03 21:33:31,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61379 conditions, 18842 events. 9133/18842 cut-off events. For 26113/26125 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 174463 event pairs, 2926 based on Foata normal form. 125/18166 useless extension candidates. Maximal degree in co-relation 52016. Up to 6119 conditions per place. [2023-08-03 21:33:31,486 INFO L140 encePairwiseOnDemand]: 450/466 looper letters, 415 selfloop transitions, 142 changer transitions 324/890 dead transitions. [2023-08-03 21:33:31,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 890 transitions, 6468 flow [2023-08-03 21:33:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-03 21:33:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-03 21:33:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5128 transitions. [2023-08-03 21:33:31,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35497715630624394 [2023-08-03 21:33:31,503 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5128 transitions. [2023-08-03 21:33:31,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5128 transitions. [2023-08-03 21:33:31,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:33:31,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5128 transitions. [2023-08-03 21:33:31,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 165.41935483870967) internal successors, (5128), 31 states have internal predecessors, (5128), 0 states have call successors, (0), 0 states 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 21:33:31,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 466.0) internal successors, (14912), 32 states have internal predecessors, (14912), 0 states have call successors, (0), 0 states 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 21:33:31,544 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 466.0) internal successors, (14912), 32 states have internal predecessors, (14912), 0 states have call successors, (0), 0 states 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 21:33:31,544 INFO L175 Difference]: Start difference. First operand has 92 places, 96 transitions, 524 flow. Second operand 31 states and 5128 transitions. [2023-08-03 21:33:31,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 890 transitions, 6468 flow [2023-08-03 21:33:31,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 890 transitions, 5615 flow, removed 304 selfloop flow, removed 2 redundant places. [2023-08-03 21:33:31,584 INFO L231 Difference]: Finished difference. Result has 134 places, 237 transitions, 1895 flow [2023-08-03 21:33:31,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1895, PETRI_PLACES=134, PETRI_TRANSITIONS=237} [2023-08-03 21:33:31,585 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 67 predicate places. [2023-08-03 21:33:31,585 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 237 transitions, 1895 flow [2023-08-03 21:33:31,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.68421052631578) internal successors, (2730), 19 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states 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 21:33:31,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:33:31,586 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:33:31,607 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 21:33:31,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:31,791 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:33:31,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:33:31,791 INFO L85 PathProgramCache]: Analyzing trace with hash 856279283, now seen corresponding path program 1 times [2023-08-03 21:33:31,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:33:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233114834] [2023-08-03 21:33:31,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:33:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:33:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:33:32,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233114834] [2023-08-03 21:33:32,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233114834] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:33:32,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453111870] [2023-08-03 21:33:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:33:32,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:33:32,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:33:32,269 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 21:33:32,271 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 21:33:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:33:32,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-03 21:33:32,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:33:32,585 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:33:32,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:32,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:32,610 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:33:32,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:33:32,684 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:33:32,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:32,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:33:32,710 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:33:32,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:33:33,044 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:33:33,044 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:33:33,999 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:33:33,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:33:35,636 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 21:33:36,762 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:33:36,769 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:33:36,781 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 17 treesize of output 11 [2023-08-03 21:33:37,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:33:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:33:37,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:33:37,680 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_324 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_324) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 21:33:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:33:39,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453111870] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:33:39,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:33:39,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2023-08-03 21:33:39,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202963781] [2023-08-03 21:33:39,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:33:39,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-03 21:33:39,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:33:39,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-03 21:33:39,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=177, Unknown=2, NotChecked=28, Total=272 [2023-08-03 21:33:39,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 466 [2023-08-03 21:33:39,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 237 transitions, 1895 flow. Second operand has 17 states, 17 states have (on average 144.8235294117647) internal successors, (2462), 17 states have internal predecessors, (2462), 0 states have call successors, (0), 0 states 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 21:33:39,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:33:39,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 466 [2023-08-03 21:33:39,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:33:47,455 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 73 DAG size of output: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:33:53,150 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 21:33:55,156 WARN L539 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 21:33:57,215 WARN L539 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 21:33:59,225 WARN L539 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 21:34:01,332 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 21:34:05,738 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 21:34:10,210 WARN L539 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 21:34:12,220 WARN L539 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 21:34:14,380 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 21:34:16,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 21:34:18,432 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 21:34:24,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 [1] [2023-08-03 21:34:27,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 21:34:34,053 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 21:34:36,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:34:38,187 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 21:34:42,655 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 21:34:44,710 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 21:34:49,006 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 21:34:51,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:34:53,133 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 21:34:55,157 WARN L539 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 21:34:57,376 WARN L539 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 21:34:59,433 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 21:35:01,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:35:03,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:35:05,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:35:07,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:35:09,750 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 21:35:11,811 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 21:35:13,832 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 21:35:15,884 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 21:35:21,166 INFO L124 PetriNetUnfolderBase]: 12318/26251 cut-off events. [2023-08-03 21:35:21,166 INFO L125 PetriNetUnfolderBase]: For 63087/63131 co-relation queries the response was YES. [2023-08-03 21:35:21,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91888 conditions, 26251 events. 12318/26251 cut-off events. For 63087/63131 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 262387 event pairs, 3530 based on Foata normal form. 161/25051 useless extension candidates. Maximal degree in co-relation 85968. Up to 11325 conditions per place. [2023-08-03 21:35:21,308 INFO L140 encePairwiseOnDemand]: 430/466 looper letters, 527 selfloop transitions, 232 changer transitions 449/1217 dead transitions. [2023-08-03 21:35:21,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1217 transitions, 9803 flow [2023-08-03 21:35:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-03 21:35:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-03 21:35:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6841 transitions. [2023-08-03 21:35:21,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3495299407316575 [2023-08-03 21:35:21,319 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 6841 transitions. [2023-08-03 21:35:21,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 6841 transitions. [2023-08-03 21:35:21,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:35:21,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 6841 transitions. [2023-08-03 21:35:21,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 162.88095238095238) internal successors, (6841), 42 states have internal predecessors, (6841), 0 states have call successors, (0), 0 states 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 21:35:21,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 466.0) internal successors, (20038), 43 states have internal predecessors, (20038), 0 states have call successors, (0), 0 states 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 21:35:21,344 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 466.0) internal successors, (20038), 43 states have internal predecessors, (20038), 0 states have call successors, (0), 0 states 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 21:35:21,344 INFO L175 Difference]: Start difference. First operand has 134 places, 237 transitions, 1895 flow. Second operand 42 states and 6841 transitions. [2023-08-03 21:35:21,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1217 transitions, 9803 flow [2023-08-03 21:35:21,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 1217 transitions, 9718 flow, removed 21 selfloop flow, removed 2 redundant places. [2023-08-03 21:35:21,686 INFO L231 Difference]: Finished difference. Result has 189 places, 452 transitions, 4515 flow [2023-08-03 21:35:21,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=1835, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=4515, PETRI_PLACES=189, PETRI_TRANSITIONS=452} [2023-08-03 21:35:21,686 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 122 predicate places. [2023-08-03 21:35:21,686 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 452 transitions, 4515 flow [2023-08-03 21:35:21,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 144.8235294117647) internal successors, (2462), 17 states have internal predecessors, (2462), 0 states have call successors, (0), 0 states 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 21:35:21,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:35:21,687 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:35:21,693 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 21:35:21,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-03 21:35:21,891 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:35:21,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:35:21,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1115079319, now seen corresponding path program 2 times [2023-08-03 21:35:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:35:21,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254047401] [2023-08-03 21:35:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:35:21,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:35:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:35:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:35:22,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:35:22,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254047401] [2023-08-03 21:35:22,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254047401] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:35:22,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593957968] [2023-08-03 21:35:22,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:35:22,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:35:22,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:35:22,288 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 21:35:22,291 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 21:35:22,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:35:22,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:35:22,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-03 21:35:22,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:35:22,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:35:22,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:35:22,576 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:35:22,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:35:22,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:35:22,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:35:22,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:35:22,690 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:35:22,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:35:22,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:35:23,077 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:35:23,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:35:24,063 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:35:24,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:35:25,759 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 11 treesize of output 7 [2023-08-03 21:35:27,036 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 21:35:27,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 370 treesize of output 375 [2023-08-03 21:35:28,088 INFO L322 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2023-08-03 21:35:28,088 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 370 treesize of output 305 [2023-08-03 21:35:29,067 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 21:35:29,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 252 treesize of output 257 [2023-08-03 21:35:29,449 INFO L322 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-08-03 21:35:29,449 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 249 treesize of output 238 [2023-08-03 21:35:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:35:29,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:35:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:35:29,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593957968] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:35:29,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:35:29,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-03 21:35:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800271704] [2023-08-03 21:35:29,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:35:29,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-03 21:35:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:35:29,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-03 21:35:29,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=246, Unknown=7, NotChecked=0, Total=342 [2023-08-03 21:35:30,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 466 [2023-08-03 21:35:30,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 452 transitions, 4515 flow. Second operand has 19 states, 19 states have (on average 143.52631578947367) internal successors, (2727), 19 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states 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 21:35:30,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:35:30,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 466 [2023-08-03 21:35:30,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:35:38,001 INFO L124 PetriNetUnfolderBase]: 11871/25578 cut-off events. [2023-08-03 21:35:38,001 INFO L125 PetriNetUnfolderBase]: For 122085/122141 co-relation queries the response was YES. [2023-08-03 21:35:38,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108873 conditions, 25578 events. 11871/25578 cut-off events. For 122085/122141 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 257210 event pairs, 2055 based on Foata normal form. 120/24242 useless extension candidates. Maximal degree in co-relation 106195. Up to 9884 conditions per place. [2023-08-03 21:35:38,240 INFO L140 encePairwiseOnDemand]: 439/466 looper letters, 499 selfloop transitions, 320 changer transitions 191/1019 dead transitions. [2023-08-03 21:35:38,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1019 transitions, 11206 flow [2023-08-03 21:35:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-03 21:35:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-03 21:35:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3644 transitions. [2023-08-03 21:35:38,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3554428404213812 [2023-08-03 21:35:38,246 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3644 transitions. [2023-08-03 21:35:38,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3644 transitions. [2023-08-03 21:35:38,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:35:38,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3644 transitions. [2023-08-03 21:35:38,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 165.63636363636363) internal successors, (3644), 22 states have internal predecessors, (3644), 0 states have call successors, (0), 0 states 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 21:35:38,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 466.0) internal successors, (10718), 23 states have internal predecessors, (10718), 0 states have call successors, (0), 0 states 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 21:35:38,287 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 466.0) internal successors, (10718), 23 states have internal predecessors, (10718), 0 states have call successors, (0), 0 states 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 21:35:38,288 INFO L175 Difference]: Start difference. First operand has 189 places, 452 transitions, 4515 flow. Second operand 22 states and 3644 transitions. [2023-08-03 21:35:38,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 1019 transitions, 11206 flow [2023-08-03 21:35:39,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 1019 transitions, 10145 flow, removed 475 selfloop flow, removed 5 redundant places. [2023-08-03 21:35:39,851 INFO L231 Difference]: Finished difference. Result has 208 places, 577 transitions, 6256 flow [2023-08-03 21:35:39,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=3879, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6256, PETRI_PLACES=208, PETRI_TRANSITIONS=577} [2023-08-03 21:35:39,851 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 141 predicate places. [2023-08-03 21:35:39,851 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 577 transitions, 6256 flow [2023-08-03 21:35:39,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.52631578947367) internal successors, (2727), 19 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states 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 21:35:39,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:35:39,852 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:35:39,856 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 21:35:40,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:35:40,056 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:35:40,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:35:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1818980372, now seen corresponding path program 1 times [2023-08-03 21:35:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:35:40,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051531325] [2023-08-03 21:35:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:35:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:35:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:35:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:35:40,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:35:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051531325] [2023-08-03 21:35:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051531325] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:35:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934054508] [2023-08-03 21:35:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:35:40,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:35:40,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:35:40,723 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 21:35:40,745 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 21:35:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:35:40,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-03 21:35:40,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:35:41,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:35:41,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:35:41,029 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:35:41,029 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:35:41,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:35:41,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:35:41,127 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:35:41,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:35:41,446 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:35:41,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 21:35:42,354 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:35:42,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 21:35:44,728 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:35:44,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 332 [2023-08-03 21:35:47,093 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:35:47,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 332 [2023-08-03 21:35:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:35:48,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:35:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:35:48,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934054508] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:35:48,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:35:48,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 18 [2023-08-03 21:35:48,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691426185] [2023-08-03 21:35:48,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:35:48,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-03 21:35:48,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:35:48,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-03 21:35:48,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=305, Unknown=4, NotChecked=0, Total=380 [2023-08-03 21:35:49,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:35:49,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 577 transitions, 6256 flow. Second operand has 20 states, 20 states have (on average 140.15) internal successors, (2803), 20 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states 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 21:35:49,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:35:49,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:35:49,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:36:06,184 INFO L124 PetriNetUnfolderBase]: 13054/29171 cut-off events. [2023-08-03 21:36:06,184 INFO L125 PetriNetUnfolderBase]: For 137954/138074 co-relation queries the response was YES. [2023-08-03 21:36:06,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126004 conditions, 29171 events. 13054/29171 cut-off events. For 137954/138074 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 309802 event pairs, 3611 based on Foata normal form. 260/27695 useless extension candidates. Maximal degree in co-relation 120080. Up to 9732 conditions per place. [2023-08-03 21:36:06,495 INFO L140 encePairwiseOnDemand]: 430/466 looper letters, 740 selfloop transitions, 488 changer transitions 554/1791 dead transitions. [2023-08-03 21:36:06,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1791 transitions, 18994 flow [2023-08-03 21:36:06,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-08-03 21:36:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-08-03 21:36:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 10488 transitions. [2023-08-03 21:36:06,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3261802575107296 [2023-08-03 21:36:06,520 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 10488 transitions. [2023-08-03 21:36:06,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 10488 transitions. [2023-08-03 21:36:06,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:36:06,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 10488 transitions. [2023-08-03 21:36:06,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 152.0) internal successors, (10488), 69 states have internal predecessors, (10488), 0 states have call successors, (0), 0 states 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 21:36:06,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 466.0) internal successors, (32620), 70 states have internal predecessors, (32620), 0 states have call successors, (0), 0 states 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 21:36:06,558 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 466.0) internal successors, (32620), 70 states have internal predecessors, (32620), 0 states have call successors, (0), 0 states 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 21:36:06,558 INFO L175 Difference]: Start difference. First operand has 208 places, 577 transitions, 6256 flow. Second operand 69 states and 10488 transitions. [2023-08-03 21:36:06,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 1791 transitions, 18994 flow [2023-08-03 21:36:07,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 1791 transitions, 18498 flow, removed 217 selfloop flow, removed 4 redundant places. [2023-08-03 21:36:07,614 INFO L231 Difference]: Finished difference. Result has 309 places, 895 transitions, 10996 flow [2023-08-03 21:36:07,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=5949, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=10996, PETRI_PLACES=309, PETRI_TRANSITIONS=895} [2023-08-03 21:36:07,614 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 242 predicate places. [2023-08-03 21:36:07,615 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 895 transitions, 10996 flow [2023-08-03 21:36:07,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 140.15) internal successors, (2803), 20 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states 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 21:36:07,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:36:07,615 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:36:07,619 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 21:36:07,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:36:07,819 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:36:07,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:36:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2062137835, now seen corresponding path program 1 times [2023-08-03 21:36:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:36:07,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153994945] [2023-08-03 21:36:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:36:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:36:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:36:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 21:36:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:36:07,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153994945] [2023-08-03 21:36:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153994945] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:36:07,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:36:07,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:36:07,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99220963] [2023-08-03 21:36:07,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:36:07,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:36:07,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:36:07,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:36:07,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:36:08,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 466 [2023-08-03 21:36:08,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 895 transitions, 10996 flow. Second operand has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:08,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:36:08,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 466 [2023-08-03 21:36:08,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:36:13,020 INFO L124 PetriNetUnfolderBase]: 9534/21532 cut-off events. [2023-08-03 21:36:13,021 INFO L125 PetriNetUnfolderBase]: For 147060/147120 co-relation queries the response was YES. [2023-08-03 21:36:13,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104270 conditions, 21532 events. 9534/21532 cut-off events. For 147060/147120 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 219319 event pairs, 2695 based on Foata normal form. 166/20119 useless extension candidates. Maximal degree in co-relation 103854. Up to 10980 conditions per place. [2023-08-03 21:36:13,416 INFO L140 encePairwiseOnDemand]: 446/466 looper letters, 772 selfloop transitions, 243 changer transitions 26/1050 dead transitions. [2023-08-03 21:36:13,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1050 transitions, 14656 flow [2023-08-03 21:36:13,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:36:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:36:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 882 transitions. [2023-08-03 21:36:13,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47317596566523606 [2023-08-03 21:36:13,417 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 882 transitions. [2023-08-03 21:36:13,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 882 transitions. [2023-08-03 21:36:13,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:36:13,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 882 transitions. [2023-08-03 21:36:13,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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 21:36:13,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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 21:36:13,419 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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 21:36:13,419 INFO L175 Difference]: Start difference. First operand has 309 places, 895 transitions, 10996 flow. Second operand 4 states and 882 transitions. [2023-08-03 21:36:13,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 1050 transitions, 14656 flow [2023-08-03 21:36:14,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 1050 transitions, 13957 flow, removed 283 selfloop flow, removed 13 redundant places. [2023-08-03 21:36:14,867 INFO L231 Difference]: Finished difference. Result has 293 places, 879 transitions, 10931 flow [2023-08-03 21:36:14,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=10217, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=882, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=243, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10931, PETRI_PLACES=293, PETRI_TRANSITIONS=879} [2023-08-03 21:36:14,868 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 226 predicate places. [2023-08-03 21:36:14,868 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 879 transitions, 10931 flow [2023-08-03 21:36:14,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:36:14,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:36:14,868 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:36:14,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 21:36:14,869 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:36:14,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:36:14,869 INFO L85 PathProgramCache]: Analyzing trace with hash -573848126, now seen corresponding path program 1 times [2023-08-03 21:36:14,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:36:14,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555409687] [2023-08-03 21:36:14,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:36:14,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:36:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:36:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:36:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:36:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555409687] [2023-08-03 21:36:15,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555409687] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:36:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982838663] [2023-08-03 21:36:15,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:36:15,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:36:15,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:36:15,177 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 21:36:15,179 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 21:36:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:36:15,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-03 21:36:15,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:36:15,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:15,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:15,615 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:36:15,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:36:15,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:15,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:15,723 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:36:15,724 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:36:16,018 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:36:16,019 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 21:36:16,926 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:36:16,926 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 21:36:19,149 INFO L322 Elim1Store]: treesize reduction 863, result has 16.7 percent of original size [2023-08-03 21:36:19,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 347 [2023-08-03 21:36:21,040 INFO L322 Elim1Store]: treesize reduction 850, result has 18.0 percent of original size [2023-08-03 21:36:21,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 377 treesize of output 366 [2023-08-03 21:36:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:36:21,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:36:21,840 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_549 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_549) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 21:36:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 21:36:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982838663] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:36:21,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:36:21,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2023-08-03 21:36:21,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545414912] [2023-08-03 21:36:21,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:36:21,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-03 21:36:21,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:36:21,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-03 21:36:21,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=1, NotChecked=22, Total=182 [2023-08-03 21:36:21,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 466 [2023-08-03 21:36:21,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 879 transitions, 10931 flow. Second operand has 14 states, 14 states have (on average 163.92857142857142) internal successors, (2295), 14 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states 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 21:36:21,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:36:21,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 466 [2023-08-03 21:36:21,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:36:27,818 INFO L124 PetriNetUnfolderBase]: 8742/20375 cut-off events. [2023-08-03 21:36:27,818 INFO L125 PetriNetUnfolderBase]: For 139186/139533 co-relation queries the response was YES. [2023-08-03 21:36:27,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98544 conditions, 20375 events. 8742/20375 cut-off events. For 139186/139533 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 210654 event pairs, 4042 based on Foata normal form. 258/19100 useless extension candidates. Maximal degree in co-relation 97486. Up to 11889 conditions per place. [2023-08-03 21:36:27,989 INFO L140 encePairwiseOnDemand]: 452/466 looper letters, 682 selfloop transitions, 102 changer transitions 226/1082 dead transitions. [2023-08-03 21:36:27,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 1082 transitions, 14818 flow [2023-08-03 21:36:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-03 21:36:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-03 21:36:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2485 transitions. [2023-08-03 21:36:28,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38090128755364805 [2023-08-03 21:36:28,006 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2485 transitions. [2023-08-03 21:36:28,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2485 transitions. [2023-08-03 21:36:28,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:36:28,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2485 transitions. [2023-08-03 21:36:28,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 177.5) internal successors, (2485), 14 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states 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 21:36:28,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 466.0) internal successors, (6990), 15 states have internal predecessors, (6990), 0 states have call successors, (0), 0 states 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 21:36:28,023 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 466.0) internal successors, (6990), 15 states have internal predecessors, (6990), 0 states have call successors, (0), 0 states 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 21:36:28,023 INFO L175 Difference]: Start difference. First operand has 293 places, 879 transitions, 10931 flow. Second operand 14 states and 2485 transitions. [2023-08-03 21:36:28,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 1082 transitions, 14818 flow [2023-08-03 21:36:29,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 1082 transitions, 14499 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-08-03 21:36:29,123 INFO L231 Difference]: Finished difference. Result has 306 places, 801 transitions, 10162 flow [2023-08-03 21:36:29,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=10309, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10162, PETRI_PLACES=306, PETRI_TRANSITIONS=801} [2023-08-03 21:36:29,125 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 239 predicate places. [2023-08-03 21:36:29,125 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 801 transitions, 10162 flow [2023-08-03 21:36:29,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 163.92857142857142) internal successors, (2295), 14 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states 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 21:36:29,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:36:29,125 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:36:29,135 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 21:36:29,329 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,SelfDestructingSolverStorable14 [2023-08-03 21:36:29,329 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:36:29,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:36:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1179036601, now seen corresponding path program 1 times [2023-08-03 21:36:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:36:29,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147265403] [2023-08-03 21:36:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:36:29,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:36:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:36:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:36:29,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:36:29,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147265403] [2023-08-03 21:36:29,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147265403] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:36:29,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245062977] [2023-08-03 21:36:29,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:36:29,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:36:29,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:36:29,577 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 21:36:29,577 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 21:36:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:36:29,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-03 21:36:29,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:36:29,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:29,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:29,969 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:36:29,970 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:36:30,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:30,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:30,052 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-08-03 21:36:30,052 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1 [2023-08-03 21:36:30,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:30,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 141 [2023-08-03 21:36:30,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:30,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 141 [2023-08-03 21:36:30,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:36:31,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:36:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:36:31,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:36:31,695 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_623) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 21:36:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-03 21:36:31,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245062977] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:36:31,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:36:31,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-03 21:36:31,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853473979] [2023-08-03 21:36:31,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:36:31,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 21:36:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:36:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 21:36:31,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=100, Unknown=1, NotChecked=20, Total=156 [2023-08-03 21:36:31,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 466 [2023-08-03 21:36:31,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 801 transitions, 10162 flow. Second operand has 13 states, 13 states have (on average 166.46153846153845) internal successors, (2164), 13 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states 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 21:36:31,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:36:31,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 466 [2023-08-03 21:36:31,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:36:35,587 INFO L124 PetriNetUnfolderBase]: 7136/16701 cut-off events. [2023-08-03 21:36:35,587 INFO L125 PetriNetUnfolderBase]: For 120586/120776 co-relation queries the response was YES. [2023-08-03 21:36:35,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81720 conditions, 16701 events. 7136/16701 cut-off events. For 120586/120776 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 166271 event pairs, 3349 based on Foata normal form. 217/15577 useless extension candidates. Maximal degree in co-relation 81632. Up to 10221 conditions per place. [2023-08-03 21:36:35,699 INFO L140 encePairwiseOnDemand]: 453/466 looper letters, 652 selfloop transitions, 95 changer transitions 224/1039 dead transitions. [2023-08-03 21:36:35,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 1039 transitions, 14547 flow [2023-08-03 21:36:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 21:36:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 21:36:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2168 transitions. [2023-08-03 21:36:35,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3876967095851216 [2023-08-03 21:36:35,701 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2168 transitions. [2023-08-03 21:36:35,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2168 transitions. [2023-08-03 21:36:35,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:36:35,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2168 transitions. [2023-08-03 21:36:35,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 180.66666666666666) internal successors, (2168), 12 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states 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 21:36:35,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 466.0) internal successors, (6058), 13 states have internal predecessors, (6058), 0 states have call successors, (0), 0 states 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 21:36:35,722 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 466.0) internal successors, (6058), 13 states have internal predecessors, (6058), 0 states have call successors, (0), 0 states 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 21:36:35,722 INFO L175 Difference]: Start difference. First operand has 306 places, 801 transitions, 10162 flow. Second operand 12 states and 2168 transitions. [2023-08-03 21:36:35,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 1039 transitions, 14547 flow [2023-08-03 21:36:36,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 1039 transitions, 14308 flow, removed 60 selfloop flow, removed 8 redundant places. [2023-08-03 21:36:36,433 INFO L231 Difference]: Finished difference. Result has 307 places, 730 transitions, 9388 flow [2023-08-03 21:36:36,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=9909, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9388, PETRI_PLACES=307, PETRI_TRANSITIONS=730} [2023-08-03 21:36:36,433 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 240 predicate places. [2023-08-03 21:36:36,433 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 730 transitions, 9388 flow [2023-08-03 21:36:36,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.46153846153845) internal successors, (2164), 13 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states 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 21:36:36,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:36:36,434 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:36:36,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-03 21:36:36,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-03 21:36:36,639 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:36:36,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:36:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1142116972, now seen corresponding path program 2 times [2023-08-03 21:36:36,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:36:36,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282940010] [2023-08-03 21:36:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:36:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:36:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:36:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:36:37,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:36:37,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282940010] [2023-08-03 21:36:37,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282940010] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:36:37,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037247103] [2023-08-03 21:36:37,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:36:37,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:36:37,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:36:37,215 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 21:36:37,244 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 21:36:37,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:36:37,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:36:37,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-03 21:36:37,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:36:37,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:37,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:37,594 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:36:37,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:36:37,629 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:36:37,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:37,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:37,713 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:36:37,714 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:36:37,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:36:38,098 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:36:38,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 412 treesize of output 339 [2023-08-03 21:36:39,125 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 21:36:40,114 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-03 21:36:40,115 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 1 case distinctions, treesize of input 420 treesize of output 420 [2023-08-03 21:36:40,654 INFO L322 Elim1Store]: treesize reduction 61, result has 20.8 percent of original size [2023-08-03 21:36:40,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 420 treesize of output 342 [2023-08-03 21:36:41,000 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-03 21:36:41,000 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 1 case distinctions, treesize of input 308 treesize of output 308 [2023-08-03 21:36:41,181 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-03 21:36:41,182 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 1 case distinctions, treesize of input 308 treesize of output 308 [2023-08-03 21:36:41,485 INFO L322 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2023-08-03 21:36:41,485 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 302 treesize of output 256 [2023-08-03 21:36:42,106 INFO L322 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-08-03 21:36:42,107 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 265 treesize of output 257 [2023-08-03 21:36:42,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 96 [2023-08-03 21:36:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:36:42,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:36:42,548 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_698 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_698) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_~#A~0.base| v_ArrVal_696) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_699) |c_~#A~0.base| v_ArrVal_700) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0))) is different from false [2023-08-03 21:36:42,568 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_698 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_698) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_~#A~0.base| v_ArrVal_696) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_699) |c_~#A~0.base| v_ArrVal_700) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0))) is different from false [2023-08-03 21:36:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-03 21:36:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037247103] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:36:42,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:36:42,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-03 21:36:42,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345278894] [2023-08-03 21:36:42,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:36:42,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-03 21:36:42,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:36:42,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-03 21:36:42,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=313, Unknown=18, NotChecked=78, Total=506 [2023-08-03 21:36:42,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 466 [2023-08-03 21:36:42,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 730 transitions, 9388 flow. Second operand has 23 states, 23 states have (on average 143.6086956521739) internal successors, (3303), 23 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states 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 21:36:42,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:36:42,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 466 [2023-08-03 21:36:42,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:36:46,002 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_698 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_698) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_~#A~0.base| v_ArrVal_696) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_699) |c_~#A~0.base| v_ArrVal_700) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0))) (or (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0) (= |c_~#A~0.offset| 0) (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 12)) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (= (select (select |c_#pthreadsMutex| |c_~#A~0.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1)))) is different from false [2023-08-03 21:36:46,490 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#A~0.offset| 12))) (let ((.cse1 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse2 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) (.cse3 (= |c_~#A~0.offset| 0)) (.cse0 (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse4))) (and (or (and .cse0 (= (select (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 1)) (and .cse1 .cse2 .cse3)) (or (forall ((v_ArrVal_698 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) .cse4 1)) |c_~#__global_lock~0.base| v_ArrVal_698) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_~#A~0.base| v_ArrVal_696) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_699) |c_~#A~0.base| v_ArrVal_700) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0))) (or (and .cse1 .cse2 .cse3 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) .cse0 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|)))))) is different from false [2023-08-03 21:36:51,617 INFO L124 PetriNetUnfolderBase]: 5749/13790 cut-off events. [2023-08-03 21:36:51,617 INFO L125 PetriNetUnfolderBase]: For 95948/96022 co-relation queries the response was YES. [2023-08-03 21:36:51,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65944 conditions, 13790 events. 5749/13790 cut-off events. For 95948/96022 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 132883 event pairs, 2649 based on Foata normal form. 173/12827 useless extension candidates. Maximal degree in co-relation 65857. Up to 6876 conditions per place. [2023-08-03 21:36:51,729 INFO L140 encePairwiseOnDemand]: 434/466 looper letters, 533 selfloop transitions, 304 changer transitions 254/1100 dead transitions. [2023-08-03 21:36:51,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1100 transitions, 14888 flow [2023-08-03 21:36:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-03 21:36:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-03 21:36:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5458 transitions. [2023-08-03 21:36:51,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33464132434089516 [2023-08-03 21:36:51,738 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 5458 transitions. [2023-08-03 21:36:51,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 5458 transitions. [2023-08-03 21:36:51,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:36:51,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 5458 transitions. [2023-08-03 21:36:51,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 155.94285714285715) internal successors, (5458), 35 states have internal predecessors, (5458), 0 states have call successors, (0), 0 states 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 21:36:51,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 466.0) internal successors, (16776), 36 states have internal predecessors, (16776), 0 states have call successors, (0), 0 states 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 21:36:51,754 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 466.0) internal successors, (16776), 36 states have internal predecessors, (16776), 0 states have call successors, (0), 0 states 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 21:36:51,754 INFO L175 Difference]: Start difference. First operand has 307 places, 730 transitions, 9388 flow. Second operand 35 states and 5458 transitions. [2023-08-03 21:36:51,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1100 transitions, 14888 flow [2023-08-03 21:36:52,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 1100 transitions, 14483 flow, removed 135 selfloop flow, removed 12 redundant places. [2023-08-03 21:36:52,332 INFO L231 Difference]: Finished difference. Result has 336 places, 691 transitions, 9782 flow [2023-08-03 21:36:52,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=8207, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=9782, PETRI_PLACES=336, PETRI_TRANSITIONS=691} [2023-08-03 21:36:52,332 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 269 predicate places. [2023-08-03 21:36:52,333 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 691 transitions, 9782 flow [2023-08-03 21:36:52,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 143.6086956521739) internal successors, (3303), 23 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states 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 21:36:52,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:36:52,333 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:36:52,337 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 21:36:52,537 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,SelfDestructingSolverStorable16 [2023-08-03 21:36:52,537 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:36:52,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:36:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1354611545, now seen corresponding path program 1 times [2023-08-03 21:36:52,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:36:52,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988254183] [2023-08-03 21:36:52,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:36:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:36:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:36:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:36:52,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:36:52,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988254183] [2023-08-03 21:36:52,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988254183] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:36:52,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941229325] [2023-08-03 21:36:52,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:36:52,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:36:52,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:36:52,803 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 21:36:52,804 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 21:36:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:36:52,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-03 21:36:52,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:36:53,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:53,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:53,132 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:36:53,132 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:36:53,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:53,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:53,214 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-08-03 21:36:53,214 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1 [2023-08-03 21:36:53,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:53,306 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 141 [2023-08-03 21:36:54,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:36:54,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:36:54,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 141 [2023-08-03 21:36:54,683 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:36:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:36:55,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:36:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:36:55,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941229325] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:36:55,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:36:55,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-03 21:36:55,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700495006] [2023-08-03 21:36:55,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:36:55,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-03 21:36:55,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:36:55,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-03 21:36:55,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-08-03 21:36:56,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 466 [2023-08-03 21:36:56,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 691 transitions, 9782 flow. Second operand has 14 states, 14 states have (on average 204.71428571428572) internal successors, (2866), 14 states have internal predecessors, (2866), 0 states have call successors, (0), 0 states 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 21:36:56,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:36:56,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 466 [2023-08-03 21:36:56,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:36:59,355 INFO L124 PetriNetUnfolderBase]: 4523/11069 cut-off events. [2023-08-03 21:36:59,355 INFO L125 PetriNetUnfolderBase]: For 83983/84121 co-relation queries the response was YES. [2023-08-03 21:36:59,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55046 conditions, 11069 events. 4523/11069 cut-off events. For 83983/84121 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 104990 event pairs, 2432 based on Foata normal form. 123/10431 useless extension candidates. Maximal degree in co-relation 54951. Up to 6985 conditions per place. [2023-08-03 21:36:59,654 INFO L140 encePairwiseOnDemand]: 454/466 looper letters, 440 selfloop transitions, 102 changer transitions 196/788 dead transitions. [2023-08-03 21:36:59,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 788 transitions, 12213 flow [2023-08-03 21:36:59,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-03 21:36:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-03 21:36:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2589 transitions. [2023-08-03 21:36:59,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46298283261802575 [2023-08-03 21:36:59,657 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2589 transitions. [2023-08-03 21:36:59,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2589 transitions. [2023-08-03 21:36:59,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:36:59,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2589 transitions. [2023-08-03 21:36:59,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 215.75) internal successors, (2589), 12 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states 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 21:36:59,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 466.0) internal successors, (6058), 13 states have internal predecessors, (6058), 0 states have call successors, (0), 0 states 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 21:36:59,662 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 466.0) internal successors, (6058), 13 states have internal predecessors, (6058), 0 states have call successors, (0), 0 states 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 21:36:59,662 INFO L175 Difference]: Start difference. First operand has 336 places, 691 transitions, 9782 flow. Second operand 12 states and 2589 transitions. [2023-08-03 21:36:59,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 788 transitions, 12213 flow [2023-08-03 21:37:00,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 788 transitions, 11774 flow, removed 118 selfloop flow, removed 14 redundant places. [2023-08-03 21:37:00,352 INFO L231 Difference]: Finished difference. Result has 330 places, 546 transitions, 7677 flow [2023-08-03 21:37:00,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=9203, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7677, PETRI_PLACES=330, PETRI_TRANSITIONS=546} [2023-08-03 21:37:00,353 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 263 predicate places. [2023-08-03 21:37:00,353 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 546 transitions, 7677 flow [2023-08-03 21:37:00,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 204.71428571428572) internal successors, (2866), 14 states have internal predecessors, (2866), 0 states have call successors, (0), 0 states 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 21:37:00,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:37:00,354 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:37:00,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-03 21:37:00,558 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,SelfDestructingSolverStorable17 [2023-08-03 21:37:00,559 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:37:00,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:37:00,559 INFO L85 PathProgramCache]: Analyzing trace with hash 595969413, now seen corresponding path program 1 times [2023-08-03 21:37:00,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:37:00,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720749840] [2023-08-03 21:37:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:00,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:37:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:37:00,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:37:00,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720749840] [2023-08-03 21:37:00,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720749840] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:37:00,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963757972] [2023-08-03 21:37:00,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:00,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:37:00,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:37:00,891 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 21:37:00,894 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 21:37:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:00,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-03 21:37:00,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:37:01,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:37:01,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:37:01,355 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 21:37:01,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:01,424 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 21:37:01,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:01,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 16 treesize of output 18 [2023-08-03 21:37:01,629 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:37:01,632 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:37:01,632 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 17 treesize of output 11 [2023-08-03 21:37:01,743 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 14 treesize of output 16 [2023-08-03 21:37:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:37:01,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:37:01,878 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 8 treesize of output 4 [2023-08-03 21:37:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:37:01,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963757972] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:37:01,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:37:01,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-03 21:37:01,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245226183] [2023-08-03 21:37:01,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:37:01,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-03 21:37:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:37:01,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-03 21:37:01,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=220, Unknown=1, NotChecked=0, Total=306 [2023-08-03 21:37:03,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 466 [2023-08-03 21:37:03,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 546 transitions, 7677 flow. Second operand has 18 states, 18 states have (on average 164.16666666666666) internal successors, (2955), 18 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states 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 21:37:03,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:37:03,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 466 [2023-08-03 21:37:03,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:37:06,336 INFO L124 PetriNetUnfolderBase]: 3354/8324 cut-off events. [2023-08-03 21:37:06,336 INFO L125 PetriNetUnfolderBase]: For 63783/63835 co-relation queries the response was YES. [2023-08-03 21:37:06,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41657 conditions, 8324 events. 3354/8324 cut-off events. For 63783/63835 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 74483 event pairs, 1300 based on Foata normal form. 233/8035 useless extension candidates. Maximal degree in co-relation 41562. Up to 3408 conditions per place. [2023-08-03 21:37:06,401 INFO L140 encePairwiseOnDemand]: 448/466 looper letters, 391 selfloop transitions, 199 changer transitions 173/772 dead transitions. [2023-08-03 21:37:06,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 772 transitions, 11033 flow [2023-08-03 21:37:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-03 21:37:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-03 21:37:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3708 transitions. [2023-08-03 21:37:06,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3789086450030656 [2023-08-03 21:37:06,404 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3708 transitions. [2023-08-03 21:37:06,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3708 transitions. [2023-08-03 21:37:06,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:37:06,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3708 transitions. [2023-08-03 21:37:06,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 176.57142857142858) internal successors, (3708), 21 states have internal predecessors, (3708), 0 states have call successors, (0), 0 states 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 21:37:06,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 466.0) internal successors, (10252), 22 states have internal predecessors, (10252), 0 states have call successors, (0), 0 states 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 21:37:06,412 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 466.0) internal successors, (10252), 22 states have internal predecessors, (10252), 0 states have call successors, (0), 0 states 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 21:37:06,412 INFO L175 Difference]: Start difference. First operand has 330 places, 546 transitions, 7677 flow. Second operand 21 states and 3708 transitions. [2023-08-03 21:37:06,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 772 transitions, 11033 flow [2023-08-03 21:37:06,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 772 transitions, 10461 flow, removed 107 selfloop flow, removed 20 redundant places. [2023-08-03 21:37:06,723 INFO L231 Difference]: Finished difference. Result has 311 places, 471 transitions, 6775 flow [2023-08-03 21:37:06,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=7009, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=6775, PETRI_PLACES=311, PETRI_TRANSITIONS=471} [2023-08-03 21:37:06,724 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 244 predicate places. [2023-08-03 21:37:06,724 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 471 transitions, 6775 flow [2023-08-03 21:37:06,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 164.16666666666666) internal successors, (2955), 18 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states 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 21:37:06,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:37:06,724 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:37:06,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-03 21:37:06,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:37:06,929 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:37:06,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:37:06,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1324379131, now seen corresponding path program 1 times [2023-08-03 21:37:06,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:37:06,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084999980] [2023-08-03 21:37:06,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:37:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:37:07,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:37:07,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084999980] [2023-08-03 21:37:07,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084999980] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:37:07,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185892249] [2023-08-03 21:37:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:07,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:37:07,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:37:07,421 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 21:37:07,439 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 21:37:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:07,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-03 21:37:07,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:37:07,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:07,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:07,732 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:37:07,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:37:07,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:07,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:07,814 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:37:07,814 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:37:08,136 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:37:08,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 21:37:10,592 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:37:10,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 405 treesize of output 370 [2023-08-03 21:37:11,813 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:37:11,814 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 21:37:13,136 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:37:13,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 332 [2023-08-03 21:37:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:37:14,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:37:14,501 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 (Array Int Int))) (= 0 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_919))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|))) is different from false [2023-08-03 21:37:14,531 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_919))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-03 21:37:14,541 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_919 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse2 |c_~#A~0.offset| (+ (select .cse2 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_919))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-03 21:37:14,567 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array Int Int)) (v_ArrVal_919 (Array Int Int))) (= (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_916))) (store .cse2 |c_~#A~0.base| (let ((.cse3 (select .cse2 |c_~#A~0.base|))) (store .cse3 |c_~#A~0.offset| (+ (select .cse3 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_919))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (- 1) (select .cse1 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-03 21:37:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-08-03 21:37:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185892249] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:37:14,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:37:14,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-08-03 21:37:14,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321336339] [2023-08-03 21:37:14,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:37:14,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 21:37:14,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:37:14,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 21:37:14,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=215, Unknown=4, NotChecked=132, Total=420 [2023-08-03 21:37:14,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 466 [2023-08-03 21:37:14,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 471 transitions, 6775 flow. Second operand has 21 states, 21 states have (on average 163.85714285714286) internal successors, (3441), 21 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states 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 21:37:14,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:37:14,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 466 [2023-08-03 21:37:14,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:37:16,895 INFO L124 PetriNetUnfolderBase]: 2595/6637 cut-off events. [2023-08-03 21:37:16,896 INFO L125 PetriNetUnfolderBase]: For 45354/45419 co-relation queries the response was YES. [2023-08-03 21:37:16,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32761 conditions, 6637 events. 2595/6637 cut-off events. For 45354/45419 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 58622 event pairs, 1508 based on Foata normal form. 11/6171 useless extension candidates. Maximal degree in co-relation 32674. Up to 4676 conditions per place. [2023-08-03 21:37:16,949 INFO L140 encePairwiseOnDemand]: 456/466 looper letters, 391 selfloop transitions, 66 changer transitions 13/515 dead transitions. [2023-08-03 21:37:16,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 515 transitions, 8041 flow [2023-08-03 21:37:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-03 21:37:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-03 21:37:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1403 transitions. [2023-08-03 21:37:16,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763412017167382 [2023-08-03 21:37:16,951 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1403 transitions. [2023-08-03 21:37:16,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1403 transitions. [2023-08-03 21:37:16,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:37:16,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1403 transitions. [2023-08-03 21:37:16,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 175.375) internal successors, (1403), 8 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states 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 21:37:16,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states 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 21:37:16,954 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states 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 21:37:16,954 INFO L175 Difference]: Start difference. First operand has 311 places, 471 transitions, 6775 flow. Second operand 8 states and 1403 transitions. [2023-08-03 21:37:16,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 515 transitions, 8041 flow [2023-08-03 21:37:17,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 515 transitions, 7619 flow, removed 61 selfloop flow, removed 20 redundant places. [2023-08-03 21:37:17,127 INFO L231 Difference]: Finished difference. Result has 285 places, 468 transitions, 6481 flow [2023-08-03 21:37:17,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=6355, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6481, PETRI_PLACES=285, PETRI_TRANSITIONS=468} [2023-08-03 21:37:17,133 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 218 predicate places. [2023-08-03 21:37:17,133 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 468 transitions, 6481 flow [2023-08-03 21:37:17,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 163.85714285714286) internal successors, (3441), 21 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states 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 21:37:17,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:37:17,134 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:37:17,139 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 21:37:17,338 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,SelfDestructingSolverStorable19 [2023-08-03 21:37:17,339 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:37:17,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:37:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash -806203740, now seen corresponding path program 1 times [2023-08-03 21:37:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:37:17,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062368500] [2023-08-03 21:37:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:37:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:37:17,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:37:17,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062368500] [2023-08-03 21:37:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062368500] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:37:17,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387111388] [2023-08-03 21:37:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:17,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:37:17,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:37:17,856 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 21:37:17,857 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 21:37:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:17,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-03 21:37:17,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:37:18,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:18,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:18,168 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:37:18,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:37:18,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:18,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:18,249 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:37:18,249 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:37:18,518 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:37:18,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 21:37:19,361 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:37:19,361 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 394 treesize of output 321 [2023-08-03 21:37:22,764 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:37:22,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 332 [2023-08-03 21:37:24,622 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:37:24,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 367 treesize of output 332 [2023-08-03 21:37:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:37:25,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:37:25,688 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_main_~d~0#1.base|) |c_ULTIMATE.start_main_~d~0#1.offset|) 0)) is different from false [2023-08-03 21:37:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 21:37:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387111388] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:37:25,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:37:25,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 17 [2023-08-03 21:37:25,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214924480] [2023-08-03 21:37:25,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:37:25,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-03 21:37:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:37:25,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-03 21:37:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=243, Unknown=1, NotChecked=32, Total=342 [2023-08-03 21:37:25,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 466 [2023-08-03 21:37:25,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 468 transitions, 6481 flow. Second operand has 19 states, 19 states have (on average 143.1578947368421) internal successors, (2720), 19 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states 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 21:37:25,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:37:25,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 466 [2023-08-03 21:37:25,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:37:27,921 INFO L124 PetriNetUnfolderBase]: 2834/7006 cut-off events. [2023-08-03 21:37:27,921 INFO L125 PetriNetUnfolderBase]: For 41453/41519 co-relation queries the response was YES. [2023-08-03 21:37:27,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33162 conditions, 7006 events. 2834/7006 cut-off events. For 41453/41519 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 60658 event pairs, 1764 based on Foata normal form. 10/6571 useless extension candidates. Maximal degree in co-relation 33085. Up to 5440 conditions per place. [2023-08-03 21:37:27,993 INFO L140 encePairwiseOnDemand]: 456/466 looper letters, 424 selfloop transitions, 52 changer transitions 44/529 dead transitions. [2023-08-03 21:37:27,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 529 transitions, 8005 flow [2023-08-03 21:37:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-03 21:37:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-03 21:37:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1267 transitions. [2023-08-03 21:37:27,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33986051502145925 [2023-08-03 21:37:27,995 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1267 transitions. [2023-08-03 21:37:27,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1267 transitions. [2023-08-03 21:37:27,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:37:27,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1267 transitions. [2023-08-03 21:37:27,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 158.375) internal successors, (1267), 8 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states 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 21:37:27,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states 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 21:37:27,998 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states 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 21:37:27,998 INFO L175 Difference]: Start difference. First operand has 285 places, 468 transitions, 6481 flow. Second operand 8 states and 1267 transitions. [2023-08-03 21:37:27,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 529 transitions, 8005 flow [2023-08-03 21:37:28,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 529 transitions, 7831 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-08-03 21:37:28,181 INFO L231 Difference]: Finished difference. Result has 282 places, 450 transitions, 6189 flow [2023-08-03 21:37:28,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=6300, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6189, PETRI_PLACES=282, PETRI_TRANSITIONS=450} [2023-08-03 21:37:28,182 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 215 predicate places. [2023-08-03 21:37:28,182 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 450 transitions, 6189 flow [2023-08-03 21:37:28,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 143.1578947368421) internal successors, (2720), 19 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states 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 21:37:28,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:37:28,182 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:37:28,188 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 21:37:28,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:37:28,387 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:37:28,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:37:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash 390068595, now seen corresponding path program 1 times [2023-08-03 21:37:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:37:28,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008826172] [2023-08-03 21:37:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:28,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:37:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 21:37:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:37:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008826172] [2023-08-03 21:37:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008826172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:37:28,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:37:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:37:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91158765] [2023-08-03 21:37:28,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:37:28,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:37:28,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:37:28,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:37:28,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:37:28,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 466 [2023-08-03 21:37:28,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 450 transitions, 6189 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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 21:37:28,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:37:28,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 466 [2023-08-03 21:37:28,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:37:29,129 INFO L124 PetriNetUnfolderBase]: 1647/4387 cut-off events. [2023-08-03 21:37:29,129 INFO L125 PetriNetUnfolderBase]: For 27354/27396 co-relation queries the response was YES. [2023-08-03 21:37:29,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21201 conditions, 4387 events. 1647/4387 cut-off events. For 27354/27396 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 36070 event pairs, 971 based on Foata normal form. 320/4352 useless extension candidates. Maximal degree in co-relation 21124. Up to 2323 conditions per place. [2023-08-03 21:37:29,166 INFO L140 encePairwiseOnDemand]: 463/466 looper letters, 385 selfloop transitions, 18 changer transitions 14/456 dead transitions. [2023-08-03 21:37:29,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 456 transitions, 7087 flow [2023-08-03 21:37:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:37:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:37:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2023-08-03 21:37:29,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128755364806867 [2023-08-03 21:37:29,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 717 transitions. [2023-08-03 21:37:29,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 717 transitions. [2023-08-03 21:37:29,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:37:29,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 717 transitions. [2023-08-03 21:37:29,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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 21:37:29,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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 21:37:29,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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 21:37:29,168 INFO L175 Difference]: Start difference. First operand has 282 places, 450 transitions, 6189 flow. Second operand 3 states and 717 transitions. [2023-08-03 21:37:29,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 456 transitions, 7087 flow [2023-08-03 21:37:29,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 456 transitions, 6815 flow, removed 19 selfloop flow, removed 16 redundant places. [2023-08-03 21:37:29,284 INFO L231 Difference]: Finished difference. Result has 241 places, 416 transitions, 5604 flow [2023-08-03 21:37:29,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=5713, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5604, PETRI_PLACES=241, PETRI_TRANSITIONS=416} [2023-08-03 21:37:29,285 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 174 predicate places. [2023-08-03 21:37:29,285 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 416 transitions, 5604 flow [2023-08-03 21:37:29,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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 21:37:29,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:37:29,285 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:37:29,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-03 21:37:29,286 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:37:29,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:37:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1643896231, now seen corresponding path program 2 times [2023-08-03 21:37:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:37:29,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178706167] [2023-08-03 21:37:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:29,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:37:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:37:29,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:37:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178706167] [2023-08-03 21:37:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178706167] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:37:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583871990] [2023-08-03 21:37:29,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:37:29,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:37:29,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:37:29,366 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 21:37:29,417 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 21:37:29,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:37:29,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:37:29,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:37:29,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:37:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:37:29,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:37:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:37:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583871990] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-03 21:37:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-03 21:37:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2023-08-03 21:37:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943484312] [2023-08-03 21:37:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:37:29,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:37:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:37:29,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:37:29,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:37:29,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 466 [2023-08-03 21:37:29,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 416 transitions, 5604 flow. Second operand has 5 states, 5 states have (on average 217.4) internal successors, (1087), 5 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states 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 21:37:29,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:37:29,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 466 [2023-08-03 21:37:29,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:37:30,353 INFO L124 PetriNetUnfolderBase]: 1620/4227 cut-off events. [2023-08-03 21:37:30,353 INFO L125 PetriNetUnfolderBase]: For 25987/26035 co-relation queries the response was YES. [2023-08-03 21:37:30,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20051 conditions, 4227 events. 1620/4227 cut-off events. For 25987/26035 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 34262 event pairs, 895 based on Foata normal form. 25/3904 useless extension candidates. Maximal degree in co-relation 19980. Up to 3463 conditions per place. [2023-08-03 21:37:30,387 INFO L140 encePairwiseOnDemand]: 463/466 looper letters, 418 selfloop transitions, 4 changer transitions 3/461 dead transitions. [2023-08-03 21:37:30,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 461 transitions, 6928 flow [2023-08-03 21:37:30,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:37:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:37:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1148 transitions. [2023-08-03 21:37:30,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927038626609442 [2023-08-03 21:37:30,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1148 transitions. [2023-08-03 21:37:30,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1148 transitions. [2023-08-03 21:37:30,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:37:30,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1148 transitions. [2023-08-03 21:37:30,389 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 21:37:30,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states 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 21:37:30,391 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states 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 21:37:30,391 INFO L175 Difference]: Start difference. First operand has 241 places, 416 transitions, 5604 flow. Second operand 5 states and 1148 transitions. [2023-08-03 21:37:30,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 461 transitions, 6928 flow [2023-08-03 21:37:30,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 461 transitions, 6718 flow, removed 30 selfloop flow, removed 15 redundant places. [2023-08-03 21:37:30,472 INFO L231 Difference]: Finished difference. Result has 224 places, 396 transitions, 5134 flow [2023-08-03 21:37:30,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=5138, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5134, PETRI_PLACES=224, PETRI_TRANSITIONS=396} [2023-08-03 21:37:30,473 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 157 predicate places. [2023-08-03 21:37:30,473 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 396 transitions, 5134 flow [2023-08-03 21:37:30,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.4) internal successors, (1087), 5 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states 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 21:37:30,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:37:30,474 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:37:30,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-03 21:37:30,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:37:30,678 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:37:30,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:37:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash 212272812, now seen corresponding path program 1 times [2023-08-03 21:37:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:37:30,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392686624] [2023-08-03 21:37:30,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:37:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-03 21:37:31,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:37:31,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392686624] [2023-08-03 21:37:31,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392686624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:37:31,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:37:31,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-03 21:37:31,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368515281] [2023-08-03 21:37:31,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:37:31,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:37:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:37:31,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:37:31,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:37:31,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 466 [2023-08-03 21:37:31,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 396 transitions, 5134 flow. Second operand has 7 states, 7 states have (on average 191.71428571428572) internal successors, (1342), 7 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states 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 21:37:31,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:37:31,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 466 [2023-08-03 21:37:31,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:37:31,938 INFO L124 PetriNetUnfolderBase]: 1650/4246 cut-off events. [2023-08-03 21:37:31,938 INFO L125 PetriNetUnfolderBase]: For 25421/25453 co-relation queries the response was YES. [2023-08-03 21:37:31,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19298 conditions, 4246 events. 1650/4246 cut-off events. For 25421/25453 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 33865 event pairs, 227 based on Foata normal form. 72/3986 useless extension candidates. Maximal degree in co-relation 19234. Up to 2029 conditions per place. [2023-08-03 21:37:31,964 INFO L140 encePairwiseOnDemand]: 445/466 looper letters, 253 selfloop transitions, 249 changer transitions 14/524 dead transitions. [2023-08-03 21:37:31,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 524 transitions, 7245 flow [2023-08-03 21:37:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-03 21:37:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-03 21:37:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1669 transitions. [2023-08-03 21:37:31,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476931330472103 [2023-08-03 21:37:31,966 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1669 transitions. [2023-08-03 21:37:31,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1669 transitions. [2023-08-03 21:37:31,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:37:31,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1669 transitions. [2023-08-03 21:37:31,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 208.625) internal successors, (1669), 8 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states 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 21:37:31,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states 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 21:37:31,969 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states 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 21:37:31,969 INFO L175 Difference]: Start difference. First operand has 224 places, 396 transitions, 5134 flow. Second operand 8 states and 1669 transitions. [2023-08-03 21:37:31,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 524 transitions, 7245 flow [2023-08-03 21:37:32,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 524 transitions, 7146 flow, removed 31 selfloop flow, removed 6 redundant places. [2023-08-03 21:37:32,038 INFO L231 Difference]: Finished difference. Result has 225 places, 440 transitions, 6156 flow [2023-08-03 21:37:32,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=5050, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6156, PETRI_PLACES=225, PETRI_TRANSITIONS=440} [2023-08-03 21:37:32,039 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 158 predicate places. [2023-08-03 21:37:32,039 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 440 transitions, 6156 flow [2023-08-03 21:37:32,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 191.71428571428572) internal successors, (1342), 7 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states 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 21:37:32,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:37:32,040 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:37:32,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-03 21:37:32,040 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:37:32,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:37:32,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1045546329, now seen corresponding path program 1 times [2023-08-03 21:37:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:37:32,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391003701] [2023-08-03 21:37:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:37:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:37:32,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:37:32,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391003701] [2023-08-03 21:37:32,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391003701] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:37:32,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456942400] [2023-08-03 21:37:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:32,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:37:32,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:37:32,683 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 21:37:32,684 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 21:37:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:32,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-03 21:37:32,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:37:32,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:33,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:33,014 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:37:33,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:37:33,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:33,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:33,121 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:37:33,121 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:37:33,458 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:37:33,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:37:34,373 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:37:34,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:37:36,222 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:37:36,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 373 treesize of output 338 [2023-08-03 21:37:38,319 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:37:38,319 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 373 treesize of output 338 [2023-08-03 21:37:41,789 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 11 treesize of output 7 [2023-08-03 21:37:42,360 INFO L322 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-08-03 21:37:42,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 367 treesize of output 356 [2023-08-03 21:37:42,741 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:37:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:37:42,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:37:42,955 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1231 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1231) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 21:37:43,003 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 20 treesize of output 14 [2023-08-03 21:37:43,162 WARN L839 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 12)) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|)) (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (forall ((v_ArrVal_1224 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1224) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))) is different from false [2023-08-03 21:37:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 21:37:43,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456942400] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:37:43,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:37:43,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 20 [2023-08-03 21:37:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65795950] [2023-08-03 21:37:43,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:37:43,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-03 21:37:43,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:37:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-03 21:37:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=302, Unknown=4, NotChecked=74, Total=462 [2023-08-03 21:37:43,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 466 [2023-08-03 21:37:43,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 440 transitions, 6156 flow. Second operand has 22 states, 22 states have (on average 141.3181818181818) internal successors, (3109), 22 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states 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 21:37:43,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:37:43,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 466 [2023-08-03 21:37:43,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:37:48,280 INFO L124 PetriNetUnfolderBase]: 2154/5591 cut-off events. [2023-08-03 21:37:48,281 INFO L125 PetriNetUnfolderBase]: For 34678/34710 co-relation queries the response was YES. [2023-08-03 21:37:48,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26210 conditions, 5591 events. 2154/5591 cut-off events. For 34678/34710 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 47674 event pairs, 466 based on Foata normal form. 23/5131 useless extension candidates. Maximal degree in co-relation 26149. Up to 1619 conditions per place. [2023-08-03 21:37:48,315 INFO L140 encePairwiseOnDemand]: 443/466 looper letters, 473 selfloop transitions, 244 changer transitions 109/834 dead transitions. [2023-08-03 21:37:48,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 834 transitions, 11341 flow [2023-08-03 21:37:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-03 21:37:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-03 21:37:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5689 transitions. [2023-08-03 21:37:48,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3212672238536255 [2023-08-03 21:37:48,320 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5689 transitions. [2023-08-03 21:37:48,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5689 transitions. [2023-08-03 21:37:48,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:37:48,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5689 transitions. [2023-08-03 21:37:48,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 149.71052631578948) internal successors, (5689), 38 states have internal predecessors, (5689), 0 states have call successors, (0), 0 states 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 21:37:48,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 466.0) internal successors, (18174), 39 states have internal predecessors, (18174), 0 states have call successors, (0), 0 states 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 21:37:48,331 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 466.0) internal successors, (18174), 39 states have internal predecessors, (18174), 0 states have call successors, (0), 0 states 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 21:37:48,331 INFO L175 Difference]: Start difference. First operand has 225 places, 440 transitions, 6156 flow. Second operand 38 states and 5689 transitions. [2023-08-03 21:37:48,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 834 transitions, 11341 flow [2023-08-03 21:37:48,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 834 transitions, 11031 flow, removed 35 selfloop flow, removed 3 redundant places. [2023-08-03 21:37:48,438 INFO L231 Difference]: Finished difference. Result has 269 places, 510 transitions, 7702 flow [2023-08-03 21:37:48,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=5968, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=7702, PETRI_PLACES=269, PETRI_TRANSITIONS=510} [2023-08-03 21:37:48,438 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 202 predicate places. [2023-08-03 21:37:48,438 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 510 transitions, 7702 flow [2023-08-03 21:37:48,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 141.3181818181818) internal successors, (3109), 22 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states 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 21:37:48,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:37:48,439 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:37:48,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-08-03 21:37:48,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-03 21:37:48,644 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:37:48,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:37:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash 260091813, now seen corresponding path program 2 times [2023-08-03 21:37:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:37:48,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096855718] [2023-08-03 21:37:48,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:37:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:37:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:37:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:37:49,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:37:49,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096855718] [2023-08-03 21:37:49,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096855718] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:37:49,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500064724] [2023-08-03 21:37:49,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:37:49,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:37:49,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:37:49,193 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 21:37:49,195 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 21:37:49,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:37:49,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:37:49,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-03 21:37:49,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:37:49,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:49,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:49,590 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:37:49,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:37:49,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:49,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:37:49,697 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:37:49,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:37:50,040 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:37:50,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:37:51,315 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:37:51,315 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:37:56,878 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:37:56,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 21:37:58,136 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:37:58,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 21:37:59,236 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 11 treesize of output 7 [2023-08-03 21:38:00,129 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 21:38:00,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 370 treesize of output 375 [2023-08-03 21:38:01,020 INFO L322 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2023-08-03 21:38:01,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 370 treesize of output 305 [2023-08-03 21:38:02,046 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 21:38:02,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 252 treesize of output 257 [2023-08-03 21:38:02,331 INFO L322 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-08-03 21:38:02,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 249 treesize of output 238 [2023-08-03 21:38:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:38:02,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:38:02,549 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1326 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1326) |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 0))) (forall ((v_ArrVal_1325 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1325) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) is different from false [2023-08-03 21:38:02,569 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:38:02,569 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 21 treesize of output 22 [2023-08-03 21:38:02,574 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:38:02,574 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 37 treesize of output 40 [2023-08-03 21:38:02,577 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 21:38:02,832 WARN L839 $PredicateComparison]: unable to prove that (or (and (<= (+ |c_~#A~0.offset| 12) |c_ULTIMATE.start_main_~m~0#1.offset|) (< |c_ULTIMATE.start_main_~m~0#1.offset| (+ |c_~#A~0.offset| 13)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#__global_lock~0.base|)) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|)) (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (forall ((v_ArrVal_1317 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1317) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))) is different from false [2023-08-03 21:38:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 21:38:02,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500064724] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:38:02,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:38:02,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-08-03 21:38:02,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886780363] [2023-08-03 21:38:02,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:38:02,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-03 21:38:02,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:38:02,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-03 21:38:02,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=368, Unknown=3, NotChecked=82, Total=552 [2023-08-03 21:38:02,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:38:02,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 510 transitions, 7702 flow. Second operand has 24 states, 24 states have (on average 139.95833333333334) internal successors, (3359), 24 states have internal predecessors, (3359), 0 states have call successors, (0), 0 states 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 21:38:02,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:38:02,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:38:02,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:38:12,373 INFO L124 PetriNetUnfolderBase]: 2095/5445 cut-off events. [2023-08-03 21:38:12,374 INFO L125 PetriNetUnfolderBase]: For 38985/39015 co-relation queries the response was YES. [2023-08-03 21:38:12,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26942 conditions, 5445 events. 2095/5445 cut-off events. For 38985/39015 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 46123 event pairs, 429 based on Foata normal form. 24/5020 useless extension candidates. Maximal degree in co-relation 26872. Up to 1682 conditions per place. [2023-08-03 21:38:12,412 INFO L140 encePairwiseOnDemand]: 439/466 looper letters, 499 selfloop transitions, 296 changer transitions 80/883 dead transitions. [2023-08-03 21:38:12,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 883 transitions, 12433 flow [2023-08-03 21:38:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-03 21:38:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-03 21:38:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 6907 transitions. [2023-08-03 21:38:12,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3153593279152589 [2023-08-03 21:38:12,418 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 6907 transitions. [2023-08-03 21:38:12,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 6907 transitions. [2023-08-03 21:38:12,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:38:12,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 6907 transitions. [2023-08-03 21:38:12,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 146.95744680851064) internal successors, (6907), 47 states have internal predecessors, (6907), 0 states have call successors, (0), 0 states 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 21:38:12,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 466.0) internal successors, (22368), 48 states have internal predecessors, (22368), 0 states have call successors, (0), 0 states 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 21:38:12,432 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 466.0) internal successors, (22368), 48 states have internal predecessors, (22368), 0 states have call successors, (0), 0 states 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 21:38:12,432 INFO L175 Difference]: Start difference. First operand has 269 places, 510 transitions, 7702 flow. Second operand 47 states and 6907 transitions. [2023-08-03 21:38:12,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 883 transitions, 12433 flow [2023-08-03 21:38:12,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 883 transitions, 12261 flow, removed 49 selfloop flow, removed 11 redundant places. [2023-08-03 21:38:12,570 INFO L231 Difference]: Finished difference. Result has 311 places, 562 transitions, 9202 flow [2023-08-03 21:38:12,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=7539, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=9202, PETRI_PLACES=311, PETRI_TRANSITIONS=562} [2023-08-03 21:38:12,570 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 244 predicate places. [2023-08-03 21:38:12,570 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 562 transitions, 9202 flow [2023-08-03 21:38:12,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 139.95833333333334) internal successors, (3359), 24 states have internal predecessors, (3359), 0 states have call successors, (0), 0 states 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 21:38:12,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:38:12,571 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:38:12,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-08-03 21:38:12,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-03 21:38:12,775 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:38:12,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:38:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1948238233, now seen corresponding path program 3 times [2023-08-03 21:38:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:38:12,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218412749] [2023-08-03 21:38:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:38:12,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:38:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:38:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:38:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:38:13,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218412749] [2023-08-03 21:38:13,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218412749] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:38:13,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912829975] [2023-08-03 21:38:13,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:38:13,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:38:13,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:38:13,289 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 21:38:13,291 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 21:38:13,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 21:38:13,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:38:13,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-03 21:38:13,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:38:13,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:13,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:13,659 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:38:13,659 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:38:13,685 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:38:13,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:13,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:13,773 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:38:13,773 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:38:13,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:38:14,118 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:38:14,118 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:38:15,114 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:38:15,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:38:16,091 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 21:38:17,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:17,421 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 21:38:18,528 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:38:18,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 21:38:20,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:20,142 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 21:38:20,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:20,236 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 21:38:22,160 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:38:22,160 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 21:38:22,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:22,954 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 21:38:23,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:38:23,263 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:38:23,263 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 17 treesize of output 11 [2023-08-03 21:38:23,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:38:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:38:24,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:38:24,241 WARN L839 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1412) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (forall ((v_ArrVal_1422 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1422) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) is different from false [2023-08-03 21:38:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 21:38:24,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912829975] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:38:24,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:38:24,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2023-08-03 21:38:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065077799] [2023-08-03 21:38:24,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:38:24,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-03 21:38:24,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:38:24,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-03 21:38:24,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=526, Unknown=4, NotChecked=48, Total=702 [2023-08-03 21:38:24,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:38:24,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 562 transitions, 9202 flow. Second operand has 27 states, 27 states have (on average 139.74074074074073) internal successors, (3773), 27 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states 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 21:38:24,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:38:24,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:38:24,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:38:34,276 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse3 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse2 (and .cse0 (= .cse3 0))) (.cse1 (forall ((v_ArrVal_1422 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1422) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~post10#1| 1)) .cse1) (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse1) (or .cse1 .cse2) (or (forall ((v_ArrVal_1422 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1422) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) .cse2) (or (and .cse0 (= .cse3 1)) .cse1)))) is different from false [2023-08-03 21:38:44,689 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse2 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse1 (forall ((v_ArrVal_1422 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1422) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~post10#1| 1)) .cse1) (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse1) (or .cse1 (and .cse0 (= .cse2 0))) (or (and .cse0 (= .cse2 1)) .cse1))) is different from false [2023-08-03 21:38:50,305 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| 3)) (.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse1 (forall ((v_ArrVal_1422 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1422) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse4 (select |c_#memory_int| 1)) (.cse3 (select |c_#memory_int| 4)) (.cse5 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|))) (and .cse0 (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~post10#1| 1)) .cse1) (= (select .cse2 4) 0) (= (select .cse3 12) 0) (= (select .cse2 16) 0) (= (select .cse2 8) 0) (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse1) (= (select .cse3 4) 0) (= (select .cse2 0) 0) (= (select .cse3 0) 0) (= (select .cse3 20) 0) (= |c_~#A~0.offset| 0) (= (select .cse4 1) 0) (= (select .cse3 16) 0) (= (select .cse3 8) 0) (= (select .cse2 12) 0) (= |c_~#A~0.base| 4) (or (and .cse0 (= .cse5 1)) .cse1) (= (select .cse3 28) 0) (= 48 (select .cse4 0)) (= (select .cse3 24) 0) (= .cse5 0))) is different from false [2023-08-03 21:38:55,162 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 21:38:58,283 INFO L124 PetriNetUnfolderBase]: 2491/6565 cut-off events. [2023-08-03 21:38:58,283 INFO L125 PetriNetUnfolderBase]: For 58495/58509 co-relation queries the response was YES. [2023-08-03 21:38:58,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34425 conditions, 6565 events. 2491/6565 cut-off events. For 58495/58509 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 58367 event pairs, 1119 based on Foata normal form. 45/6226 useless extension candidates. Maximal degree in co-relation 34348. Up to 3121 conditions per place. [2023-08-03 21:38:58,346 INFO L140 encePairwiseOnDemand]: 433/466 looper letters, 565 selfloop transitions, 292 changer transitions 176/1041 dead transitions. [2023-08-03 21:38:58,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1041 transitions, 16205 flow [2023-08-03 21:38:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-08-03 21:38:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-08-03 21:38:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 10111 transitions. [2023-08-03 21:38:58,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30996321275291233 [2023-08-03 21:38:58,354 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 10111 transitions. [2023-08-03 21:38:58,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 10111 transitions. [2023-08-03 21:38:58,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:38:58,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 10111 transitions. [2023-08-03 21:38:58,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 144.44285714285715) internal successors, (10111), 70 states have internal predecessors, (10111), 0 states have call successors, (0), 0 states 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 21:38:58,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 466.0) internal successors, (33086), 71 states have internal predecessors, (33086), 0 states have call successors, (0), 0 states 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 21:38:58,380 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 466.0) internal successors, (33086), 71 states have internal predecessors, (33086), 0 states have call successors, (0), 0 states 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 21:38:58,380 INFO L175 Difference]: Start difference. First operand has 311 places, 562 transitions, 9202 flow. Second operand 70 states and 10111 transitions. [2023-08-03 21:38:58,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 1041 transitions, 16205 flow [2023-08-03 21:38:58,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 1041 transitions, 15901 flow, removed 61 selfloop flow, removed 22 redundant places. [2023-08-03 21:38:58,629 INFO L231 Difference]: Finished difference. Result has 378 places, 654 transitions, 11166 flow [2023-08-03 21:38:58,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=8968, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=11166, PETRI_PLACES=378, PETRI_TRANSITIONS=654} [2023-08-03 21:38:58,630 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 311 predicate places. [2023-08-03 21:38:58,630 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 654 transitions, 11166 flow [2023-08-03 21:38:58,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 139.74074074074073) internal successors, (3773), 27 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states 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 21:38:58,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:38:58,630 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:38:58,635 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 21:38:58,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-03 21:38:58,837 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:38:58,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:38:58,837 INFO L85 PathProgramCache]: Analyzing trace with hash -227068451, now seen corresponding path program 4 times [2023-08-03 21:38:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:38:58,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539167080] [2023-08-03 21:38:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:38:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:38:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:38:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:38:59,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:38:59,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539167080] [2023-08-03 21:38:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539167080] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:38:59,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130568211] [2023-08-03 21:38:59,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 21:38:59,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:38:59,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:38:59,413 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 21:38:59,417 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 21:38:59,552 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 21:38:59,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:38:59,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 21:38:59,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:38:59,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:59,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:59,772 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:38:59,772 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:38:59,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:38:59,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:59,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:38:59,878 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:38:59,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:38:59,922 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:39:00,254 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:39:00,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:39:01,267 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:39:01,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:39:02,322 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 21:39:03,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:39:03,742 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 21:39:05,433 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:39:05,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 21:39:06,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:39:06,419 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 21:39:07,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:39:07,337 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 21:39:08,073 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:39:08,078 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:39:08,078 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 17 treesize of output 11 [2023-08-03 21:39:08,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:39:09,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:39:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:39:09,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:39:09,428 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1516 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (forall ((v_ArrVal_1509 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1509) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))) is different from false [2023-08-03 21:39:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-03 21:39:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130568211] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:39:09,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:39:09,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 29 [2023-08-03 21:39:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525980294] [2023-08-03 21:39:09,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:39:09,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-03 21:39:09,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:39:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-03 21:39:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=727, Unknown=4, NotChecked=56, Total=930 [2023-08-03 21:39:09,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:39:09,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 654 transitions, 11166 flow. Second operand has 31 states, 31 states have (on average 139.32258064516128) internal successors, (4319), 31 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states 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 21:39:09,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:39:09,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:39:09,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:39:17,474 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 21:39:27,300 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 21:39:29,516 INFO L124 PetriNetUnfolderBase]: 2916/7757 cut-off events. [2023-08-03 21:39:29,516 INFO L125 PetriNetUnfolderBase]: For 82950/82960 co-relation queries the response was YES. [2023-08-03 21:39:29,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43931 conditions, 7757 events. 2916/7757 cut-off events. For 82950/82960 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 71946 event pairs, 1278 based on Foata normal form. 87/7375 useless extension candidates. Maximal degree in co-relation 43832. Up to 3597 conditions per place. [2023-08-03 21:39:29,585 INFO L140 encePairwiseOnDemand]: 434/466 looper letters, 567 selfloop transitions, 305 changer transitions 367/1247 dead transitions. [2023-08-03 21:39:29,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1247 transitions, 20593 flow [2023-08-03 21:39:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-08-03 21:39:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2023-08-03 21:39:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 12975 transitions. [2023-08-03 21:39:29,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3093705293276109 [2023-08-03 21:39:29,593 INFO L72 ComplementDD]: Start complementDD. Operand 90 states and 12975 transitions. [2023-08-03 21:39:29,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 12975 transitions. [2023-08-03 21:39:29,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:39:29,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 90 states and 12975 transitions. [2023-08-03 21:39:29,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 91 states, 90 states have (on average 144.16666666666666) internal successors, (12975), 90 states have internal predecessors, (12975), 0 states have call successors, (0), 0 states 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 21:39:29,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 91 states, 91 states have (on average 466.0) internal successors, (42406), 91 states have internal predecessors, (42406), 0 states have call successors, (0), 0 states 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 21:39:29,624 INFO L81 ComplementDD]: Finished complementDD. Result has 91 states, 91 states have (on average 466.0) internal successors, (42406), 91 states have internal predecessors, (42406), 0 states have call successors, (0), 0 states 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 21:39:29,624 INFO L175 Difference]: Start difference. First operand has 378 places, 654 transitions, 11166 flow. Second operand 90 states and 12975 transitions. [2023-08-03 21:39:29,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 1247 transitions, 20593 flow [2023-08-03 21:39:30,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 1247 transitions, 19689 flow, removed 335 selfloop flow, removed 28 redundant places. [2023-08-03 21:39:30,054 INFO L231 Difference]: Finished difference. Result has 465 places, 695 transitions, 12167 flow [2023-08-03 21:39:30,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=10554, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=12167, PETRI_PLACES=465, PETRI_TRANSITIONS=695} [2023-08-03 21:39:30,055 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 398 predicate places. [2023-08-03 21:39:30,055 INFO L495 AbstractCegarLoop]: Abstraction has has 465 places, 695 transitions, 12167 flow [2023-08-03 21:39:30,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 139.32258064516128) internal successors, (4319), 31 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states 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 21:39:30,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:39:30,056 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:39:30,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-08-03 21:39:30,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:39:30,260 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:39:30,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:39:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1387341613, now seen corresponding path program 5 times [2023-08-03 21:39:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:39:30,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158200729] [2023-08-03 21:39:30,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:39:30,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:39:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:39:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:39:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:39:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158200729] [2023-08-03 21:39:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158200729] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:39:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614285228] [2023-08-03 21:39:30,974 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-03 21:39:30,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:39:30,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:39:30,975 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 21:39:30,977 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 21:39:31,111 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-03 21:39:31,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:39:31,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 21:39:31,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:39:31,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:39:31,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:39:31,322 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:39:31,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:39:31,365 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:39:31,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:39:31,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:39:31,434 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:39:31,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:39:31,483 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:39:31,796 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:39:31,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:39:32,725 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:39:32,725 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:39:34,525 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 21:39:35,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:39:35,173 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 21:39:36,167 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:39:36,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 21:39:36,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:39:36,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 16 treesize of output 18 [2023-08-03 21:39:36,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:39:36,842 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 21:39:37,159 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:39:37,164 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:39:37,164 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 17 treesize of output 11 [2023-08-03 21:39:37,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:39:38,527 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:39:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:39:38,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:39:38,736 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1615) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 21:39:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:39:39,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614285228] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:39:39,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:39:39,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 29 [2023-08-03 21:39:39,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908455083] [2023-08-03 21:39:39,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:39:39,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-03 21:39:39,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:39:39,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-03 21:39:39,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=728, Unknown=7, NotChecked=56, Total=930 [2023-08-03 21:39:39,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:39:39,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 695 transitions, 12167 flow. Second operand has 31 states, 31 states have (on average 139.5483870967742) internal successors, (4326), 31 states have internal predecessors, (4326), 0 states have call successors, (0), 0 states 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 21:39:39,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:39:39,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:39:39,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:39:46,434 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse3 (forall ((v_ArrVal_1612 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse1 (select |c_#memory_int| 3)) (.cse6 (select |c_#memory_int| 1)) (.cse2 (select |c_#memory_int| 4)) (.cse4 (= .cse5 0))) (and .cse0 (= (select .cse1 4) 0) (= (select .cse2 12) 0) (= (select .cse1 16) 0) (= (select .cse1 8) 0) (= (select .cse2 4) 0) (= (select .cse1 0) 0) (= (select .cse2 0) 0) (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse3) (= (select .cse2 20) 0) (or (and .cse0 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) .cse4) (and (< |c_~#__global_lock~0.offset| (+ |c_~#A~0.offset| 1)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (+ 12 |c_~#__global_lock~0.offset|)) (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (<= |c_~#A~0.offset| |c_~#__global_lock~0.offset|))) (or (and .cse0 (= .cse5 1)) .cse3) (= |c_~#A~0.offset| 0) (= (select .cse6 1) 0) (= (select .cse2 16) 0) (= (select .cse2 8) 0) (= (select .cse1 12) 0) (= |c_~#A~0.base| 4) (= (select .cse2 28) 0) (= 48 (select .cse6 0)) (= (select .cse2 24) 0) .cse4))) is different from false [2023-08-03 21:39:46,452 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse1 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse2 (forall ((v_ArrVal_1612 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (or (and .cse0 (= .cse1 0)) .cse2) (or (forall ((v_ArrVal_1612 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (and .cse0 (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))) (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse2) (or (and .cse0 (= .cse1 1)) .cse2))) is different from false [2023-08-03 21:40:00,393 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)))) (and .cse0 (or (forall ((v_ArrVal_1612 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (and .cse0 (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))) (= (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|) 1))) is different from false [2023-08-03 21:40:01,674 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse3 (forall ((v_ArrVal_1612 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse1 (select |c_#memory_int| 3)) (.cse5 (select |c_#memory_int| 1)) (.cse2 (select |c_#memory_int| 4)) (.cse4 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|))) (and .cse0 (= (select .cse1 4) 0) (= (select .cse2 12) 0) (= (select .cse1 16) 0) (= (select .cse1 8) 0) (= (select .cse2 4) 0) (= (select .cse1 0) 0) (= (select .cse2 0) 0) (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse3) (= (select .cse2 20) 0) (or (and .cse0 (= .cse4 1)) .cse3) (= |c_~#A~0.offset| 0) (= (select .cse5 1) 0) (= (select .cse2 16) 0) (= (select .cse2 8) 0) (= (select .cse1 12) 0) (= |c_~#A~0.base| 4) (= (select .cse2 28) 0) (= 48 (select .cse5 0)) (= (select .cse2 24) 0) (= .cse4 0))) is different from false [2023-08-03 21:40:01,901 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (.cse1 (forall ((v_ArrVal_1612 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse2 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|))) (and .cse0 (or (forall ((v_ArrVal_1612 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (and .cse0 (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))) (or (and .cse0 (= |c_t_funThread1of2ForFork0_#t~mem6#1| 0)) .cse1) (or (and .cse0 (= .cse2 1)) .cse1) (= .cse2 0))) is different from false [2023-08-03 21:40:03,298 INFO L124 PetriNetUnfolderBase]: 2615/7056 cut-off events. [2023-08-03 21:40:03,298 INFO L125 PetriNetUnfolderBase]: For 88096/88121 co-relation queries the response was YES. [2023-08-03 21:40:03,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41481 conditions, 7056 events. 2615/7056 cut-off events. For 88096/88121 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 64729 event pairs, 1429 based on Foata normal form. 121/6740 useless extension candidates. Maximal degree in co-relation 41355. Up to 4170 conditions per place. [2023-08-03 21:40:03,388 INFO L140 encePairwiseOnDemand]: 430/466 looper letters, 619 selfloop transitions, 233 changer transitions 168/1028 dead transitions. [2023-08-03 21:40:03,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 1028 transitions, 18376 flow [2023-08-03 21:40:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-08-03 21:40:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-08-03 21:40:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 8607 transitions. [2023-08-03 21:40:03,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30783261802575107 [2023-08-03 21:40:03,394 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 8607 transitions. [2023-08-03 21:40:03,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 8607 transitions. [2023-08-03 21:40:03,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:40:03,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 8607 transitions. [2023-08-03 21:40:03,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 143.45) internal successors, (8607), 60 states have internal predecessors, (8607), 0 states have call successors, (0), 0 states 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 21:40:03,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 466.0) internal successors, (28426), 61 states have internal predecessors, (28426), 0 states have call successors, (0), 0 states 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 21:40:03,414 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 466.0) internal successors, (28426), 61 states have internal predecessors, (28426), 0 states have call successors, (0), 0 states 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 21:40:03,414 INFO L175 Difference]: Start difference. First operand has 465 places, 695 transitions, 12167 flow. Second operand 60 states and 8607 transitions. [2023-08-03 21:40:03,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 1028 transitions, 18376 flow [2023-08-03 21:40:03,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 1028 transitions, 17517 flow, removed 296 selfloop flow, removed 45 redundant places. [2023-08-03 21:40:03,958 INFO L231 Difference]: Finished difference. Result has 474 places, 741 transitions, 12902 flow [2023-08-03 21:40:03,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=11526, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=12902, PETRI_PLACES=474, PETRI_TRANSITIONS=741} [2023-08-03 21:40:03,959 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 407 predicate places. [2023-08-03 21:40:03,959 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 741 transitions, 12902 flow [2023-08-03 21:40:03,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 139.5483870967742) internal successors, (4326), 31 states have internal predecessors, (4326), 0 states have call successors, (0), 0 states 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 21:40:03,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:40:03,959 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:40:03,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-08-03 21:40:04,162 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,SelfDestructingSolverStorable28 [2023-08-03 21:40:04,163 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:40:04,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:40:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2025995026, now seen corresponding path program 1 times [2023-08-03 21:40:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:40:04,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717963543] [2023-08-03 21:40:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:40:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:40:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:40:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-03 21:40:04,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:40:04,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717963543] [2023-08-03 21:40:04,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717963543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:40:04,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:40:04,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-03 21:40:04,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366215275] [2023-08-03 21:40:04,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:40:04,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-03 21:40:04,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:40:04,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-03 21:40:04,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:40:04,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 466 [2023-08-03 21:40:04,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 741 transitions, 12902 flow. Second operand has 7 states, 7 states have (on average 199.14285714285714) internal successors, (1394), 7 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states 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 21:40:04,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:40:04,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 466 [2023-08-03 21:40:04,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:40:06,378 INFO L124 PetriNetUnfolderBase]: 2192/6219 cut-off events. [2023-08-03 21:40:06,378 INFO L125 PetriNetUnfolderBase]: For 76120/76183 co-relation queries the response was YES. [2023-08-03 21:40:06,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39172 conditions, 6219 events. 2192/6219 cut-off events. For 76120/76183 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 57100 event pairs, 729 based on Foata normal form. 79/5959 useless extension candidates. Maximal degree in co-relation 39034. Up to 2508 conditions per place. [2023-08-03 21:40:06,451 INFO L140 encePairwiseOnDemand]: 459/466 looper letters, 615 selfloop transitions, 261 changer transitions 1/949 dead transitions. [2023-08-03 21:40:06,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 949 transitions, 17538 flow [2023-08-03 21:40:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:40:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:40:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1106 transitions. [2023-08-03 21:40:06,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47467811158798284 [2023-08-03 21:40:06,453 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1106 transitions. [2023-08-03 21:40:06,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1106 transitions. [2023-08-03 21:40:06,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:40:06,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1106 transitions. [2023-08-03 21:40:06,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 221.2) internal successors, (1106), 5 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states 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 21:40:06,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states 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 21:40:06,455 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states 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 21:40:06,455 INFO L175 Difference]: Start difference. First operand has 474 places, 741 transitions, 12902 flow. Second operand 5 states and 1106 transitions. [2023-08-03 21:40:06,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 949 transitions, 17538 flow [2023-08-03 21:40:06,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 949 transitions, 17104 flow, removed 111 selfloop flow, removed 33 redundant places. [2023-08-03 21:40:06,964 INFO L231 Difference]: Finished difference. Result has 438 places, 781 transitions, 14170 flow [2023-08-03 21:40:06,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=12355, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14170, PETRI_PLACES=438, PETRI_TRANSITIONS=781} [2023-08-03 21:40:06,965 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 371 predicate places. [2023-08-03 21:40:06,965 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 781 transitions, 14170 flow [2023-08-03 21:40:06,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 199.14285714285714) internal successors, (1394), 7 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states 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 21:40:06,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:40:06,965 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:40:06,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-03 21:40:06,965 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:40:06,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:40:06,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1340113087, now seen corresponding path program 6 times [2023-08-03 21:40:06,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:40:06,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732562257] [2023-08-03 21:40:06,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:40:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:40:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:40:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:40:07,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:40:07,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732562257] [2023-08-03 21:40:07,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732562257] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:40:07,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124237543] [2023-08-03 21:40:07,326 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-03 21:40:07,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:40:07,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:40:07,328 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 21:40:07,329 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 21:40:07,502 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-03 21:40:07,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:40:07,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-03 21:40:07,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:40:07,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:07,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:07,687 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:40:07,687 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:40:07,733 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:40:07,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:07,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:07,820 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:40:07,820 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:40:07,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:40:08,196 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:40:08,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:40:08,654 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 21:40:10,540 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:40:10,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:40:12,756 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:40:12,768 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:40:12,768 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 17 treesize of output 11 [2023-08-03 21:40:14,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:40:14,682 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 32 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 151 [2023-08-03 21:40:15,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 32 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 151 [2023-08-03 21:40:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:40:16,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:40:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:40:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124237543] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:40:16,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:40:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-08-03 21:40:16,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871814389] [2023-08-03 21:40:16,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:40:16,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 21:40:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:40:16,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 21:40:16,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=341, Unknown=1, NotChecked=0, Total=420 [2023-08-03 21:40:17,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 466 [2023-08-03 21:40:17,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 781 transitions, 14170 flow. Second operand has 21 states, 21 states have (on average 141.14285714285714) internal successors, (2964), 21 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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 21:40:17,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:40:17,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 466 [2023-08-03 21:40:17,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:40:23,270 INFO L124 PetriNetUnfolderBase]: 2779/7506 cut-off events. [2023-08-03 21:40:23,271 INFO L125 PetriNetUnfolderBase]: For 91810/91852 co-relation queries the response was YES. [2023-08-03 21:40:23,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47547 conditions, 7506 events. 2779/7506 cut-off events. For 91810/91852 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 69116 event pairs, 1337 based on Foata normal form. 65/7173 useless extension candidates. Maximal degree in co-relation 47415. Up to 4324 conditions per place. [2023-08-03 21:40:23,358 INFO L140 encePairwiseOnDemand]: 443/466 looper letters, 718 selfloop transitions, 185 changer transitions 148/1059 dead transitions. [2023-08-03 21:40:23,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 1059 transitions, 19769 flow [2023-08-03 21:40:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-03 21:40:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-03 21:40:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 5450 transitions. [2023-08-03 21:40:23,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31608862080965083 [2023-08-03 21:40:23,362 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 5450 transitions. [2023-08-03 21:40:23,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 5450 transitions. [2023-08-03 21:40:23,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:40:23,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 5450 transitions. [2023-08-03 21:40:23,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 147.2972972972973) internal successors, (5450), 37 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states 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 21:40:23,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 466.0) internal successors, (17708), 38 states have internal predecessors, (17708), 0 states have call successors, (0), 0 states 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 21:40:23,373 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 466.0) internal successors, (17708), 38 states have internal predecessors, (17708), 0 states have call successors, (0), 0 states 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 21:40:23,373 INFO L175 Difference]: Start difference. First operand has 438 places, 781 transitions, 14170 flow. Second operand 37 states and 5450 transitions. [2023-08-03 21:40:23,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 1059 transitions, 19769 flow [2023-08-03 21:40:23,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 1059 transitions, 19766 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:40:23,969 INFO L231 Difference]: Finished difference. Result has 483 places, 776 transitions, 14496 flow [2023-08-03 21:40:23,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=14167, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=14496, PETRI_PLACES=483, PETRI_TRANSITIONS=776} [2023-08-03 21:40:23,970 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 416 predicate places. [2023-08-03 21:40:23,970 INFO L495 AbstractCegarLoop]: Abstraction has has 483 places, 776 transitions, 14496 flow [2023-08-03 21:40:23,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 141.14285714285714) internal successors, (2964), 21 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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 21:40:23,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:40:23,970 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:40:23,989 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 21:40:24,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:40:24,176 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:40:24,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:40:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1938634045, now seen corresponding path program 7 times [2023-08-03 21:40:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:40:24,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695060857] [2023-08-03 21:40:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:40:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:40:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:40:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:40:25,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:40:25,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695060857] [2023-08-03 21:40:25,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695060857] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:40:25,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557909515] [2023-08-03 21:40:25,300 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-03 21:40:25,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:40:25,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:40:25,301 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:40:25,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-03 21:40:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:40:25,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 21:40:25,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:40:25,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:40:26,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:26,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:26,028 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:40:26,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:40:26,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:40:26,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:26,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:26,131 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:40:26,131 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:40:26,433 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:40:26,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:40:27,682 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 21:40:28,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:28,492 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 21:40:29,563 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:40:29,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 417 treesize of output 382 [2023-08-03 21:40:30,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:30,418 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 21:40:30,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:40:30,523 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 21:40:31,184 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:40:31,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:40:34,354 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:40:34,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 373 treesize of output 338 [2023-08-03 21:40:34,710 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:40:34,714 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:40:34,714 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 17 treesize of output 11 [2023-08-03 21:40:35,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:40:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:40:35,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:40:35,445 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1844) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 21:40:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:40:35,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557909515] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:40:35,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:40:35,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-08-03 21:40:35,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038104590] [2023-08-03 21:40:35,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:40:35,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-03 21:40:35,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:40:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-03 21:40:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=846, Unknown=10, NotChecked=60, Total=1056 [2023-08-03 21:40:36,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:40:36,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 776 transitions, 14496 flow. Second operand has 33 states, 33 states have (on average 139.36363636363637) internal successors, (4599), 33 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states 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 21:40:36,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:40:36,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:40:36,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:40:44,520 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 21:40:46,535 WARN L539 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 21:40:48,576 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 21:40:50,834 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 21:40:53,423 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 21:40:58,183 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 21:41:01,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 21:41:03,422 WARN L539 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 21:41:05,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:41:07,582 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 21:41:09,593 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 21:41:11,601 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 21:41:13,767 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 21:41:15,782 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 21:41:17,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 [1] [2023-08-03 21:41:22,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:41:24,762 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 21:41:25,479 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (.cse1 (select (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset|))) (or (and .cse0 (or (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| (store (select |c_#pthreadsMutex| |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset| 1)) |c_~#A~0.base|) 12) 1) (= |c_~#A~0.offset| 0) (< |c_ULTIMATE.start_main_~m~0#1.offset| 13) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) (<= 12 |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_~#A~0.offset| |c_ULTIMATE.start_main_~d~0#1.offset|))) (= .cse1 1)) (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) .cse0 (<= .cse1 1) (<= 1 .cse1)))) (or (forall ((v_ArrVal_1840 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1840) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) (forall ((v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1841 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1841))) (store .cse2 |c_~#A~0.base| (let ((.cse3 (select .cse2 |c_~#A~0.base|))) (store .cse3 |c_~#A~0.offset| (+ (- 1) (select .cse3 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_1844) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))) is different from false [2023-08-03 21:41:33,396 INFO L124 PetriNetUnfolderBase]: 2738/7624 cut-off events. [2023-08-03 21:41:33,397 INFO L125 PetriNetUnfolderBase]: For 100359/100401 co-relation queries the response was YES. [2023-08-03 21:41:33,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50006 conditions, 7624 events. 2738/7624 cut-off events. For 100359/100401 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 71714 event pairs, 1208 based on Foata normal form. 56/7230 useless extension candidates. Maximal degree in co-relation 49864. Up to 4138 conditions per place. [2023-08-03 21:41:33,479 INFO L140 encePairwiseOnDemand]: 430/466 looper letters, 654 selfloop transitions, 382 changer transitions 233/1277 dead transitions. [2023-08-03 21:41:33,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 1277 transitions, 24075 flow [2023-08-03 21:41:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-08-03 21:41:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2023-08-03 21:41:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 9527 transitions. [2023-08-03 21:41:33,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3097606970997529 [2023-08-03 21:41:33,502 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 9527 transitions. [2023-08-03 21:41:33,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 9527 transitions. [2023-08-03 21:41:33,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:41:33,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 9527 transitions. [2023-08-03 21:41:33,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 144.34848484848484) internal successors, (9527), 66 states have internal predecessors, (9527), 0 states have call successors, (0), 0 states 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 21:41:33,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 466.0) internal successors, (31222), 67 states have internal predecessors, (31222), 0 states have call successors, (0), 0 states 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 21:41:33,539 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 466.0) internal successors, (31222), 67 states have internal predecessors, (31222), 0 states have call successors, (0), 0 states 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 21:41:33,539 INFO L175 Difference]: Start difference. First operand has 483 places, 776 transitions, 14496 flow. Second operand 66 states and 9527 transitions. [2023-08-03 21:41:33,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 1277 transitions, 24075 flow [2023-08-03 21:41:34,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 1277 transitions, 23834 flow, removed 60 selfloop flow, removed 19 redundant places. [2023-08-03 21:41:34,212 INFO L231 Difference]: Finished difference. Result has 559 places, 889 transitions, 17412 flow [2023-08-03 21:41:34,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=14316, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=17412, PETRI_PLACES=559, PETRI_TRANSITIONS=889} [2023-08-03 21:41:34,213 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 492 predicate places. [2023-08-03 21:41:34,213 INFO L495 AbstractCegarLoop]: Abstraction has has 559 places, 889 transitions, 17412 flow [2023-08-03 21:41:34,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 139.36363636363637) internal successors, (4599), 33 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states 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 21:41:34,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:41:34,213 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:41:34,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-03 21:41:34,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:41:34,419 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:41:34,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:41:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2118674525, now seen corresponding path program 8 times [2023-08-03 21:41:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:41:34,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226575884] [2023-08-03 21:41:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:41:34,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:41:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:41:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:41:34,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:41:34,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226575884] [2023-08-03 21:41:34,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226575884] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:41:34,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376656851] [2023-08-03 21:41:34,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:41:34,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:41:34,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:41:34,872 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:41:34,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-03 21:41:35,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:41:35,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:41:35,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-03 21:41:35,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:41:35,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:41:35,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:41:35,240 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:41:35,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:41:35,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:41:35,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:41:35,364 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:41:35,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:41:35,726 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:41:35,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:41:41,054 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:41:41,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 417 treesize of output 382 [2023-08-03 21:41:42,021 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:41:42,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:41:43,156 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:41:43,157 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 379 treesize of output 344 [2023-08-03 21:41:46,063 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 11 treesize of output 7 [2023-08-03 21:41:47,963 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 21:41:47,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 370 treesize of output 375 [2023-08-03 21:41:49,384 INFO L322 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2023-08-03 21:41:49,384 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 299 [2023-08-03 21:41:50,406 INFO L322 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-08-03 21:41:50,407 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 249 treesize of output 238 [2023-08-03 21:41:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:41:50,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:41:50,816 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:41:50,816 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 21 treesize of output 22 [2023-08-03 21:41:50,822 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-03 21:41:50,822 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 37 treesize of output 40 [2023-08-03 21:41:50,825 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 21:41:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:41:51,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376656851] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:41:51,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:41:51,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2023-08-03 21:41:51,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476733407] [2023-08-03 21:41:51,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:41:51,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-03 21:41:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:41:51,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-03 21:41:51,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=412, Unknown=1, NotChecked=0, Total=506 [2023-08-03 21:41:52,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:41:52,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 889 transitions, 17412 flow. Second operand has 23 states, 23 states have (on average 139.56521739130434) internal successors, (3210), 23 states have internal predecessors, (3210), 0 states have call successors, (0), 0 states 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 21:41:52,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:41:52,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:41:52,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:41:58,885 INFO L124 PetriNetUnfolderBase]: 2377/6577 cut-off events. [2023-08-03 21:41:58,885 INFO L125 PetriNetUnfolderBase]: For 108844/108900 co-relation queries the response was YES. [2023-08-03 21:41:58,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47495 conditions, 6577 events. 2377/6577 cut-off events. For 108844/108900 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 59785 event pairs, 496 based on Foata normal form. 23/6268 useless extension candidates. Maximal degree in co-relation 47322. Up to 1194 conditions per place. [2023-08-03 21:41:59,007 INFO L140 encePairwiseOnDemand]: 443/466 looper letters, 666 selfloop transitions, 397 changer transitions 58/1129 dead transitions. [2023-08-03 21:41:59,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 1129 transitions, 22870 flow [2023-08-03 21:41:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-03 21:41:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-03 21:41:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4994 transitions. [2023-08-03 21:41:59,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31519818227720275 [2023-08-03 21:41:59,011 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4994 transitions. [2023-08-03 21:41:59,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4994 transitions. [2023-08-03 21:41:59,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:41:59,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4994 transitions. [2023-08-03 21:41:59,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 146.88235294117646) internal successors, (4994), 34 states have internal predecessors, (4994), 0 states have call successors, (0), 0 states 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 21:41:59,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 466.0) internal successors, (16310), 35 states have internal predecessors, (16310), 0 states have call successors, (0), 0 states 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 21:41:59,023 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 466.0) internal successors, (16310), 35 states have internal predecessors, (16310), 0 states have call successors, (0), 0 states 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 21:41:59,023 INFO L175 Difference]: Start difference. First operand has 559 places, 889 transitions, 17412 flow. Second operand 34 states and 4994 transitions. [2023-08-03 21:41:59,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 1129 transitions, 22870 flow [2023-08-03 21:41:59,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 1129 transitions, 22125 flow, removed 241 selfloop flow, removed 25 redundant places. [2023-08-03 21:41:59,964 INFO L231 Difference]: Finished difference. Result has 563 places, 925 transitions, 18778 flow [2023-08-03 21:41:59,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=16790, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=18778, PETRI_PLACES=563, PETRI_TRANSITIONS=925} [2023-08-03 21:41:59,965 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 496 predicate places. [2023-08-03 21:41:59,965 INFO L495 AbstractCegarLoop]: Abstraction has has 563 places, 925 transitions, 18778 flow [2023-08-03 21:41:59,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 139.56521739130434) internal successors, (3210), 23 states have internal predecessors, (3210), 0 states have call successors, (0), 0 states 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 21:41:59,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:41:59,966 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:41:59,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-08-03 21:42:00,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:42:00,170 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:42:00,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:42:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1138015395, now seen corresponding path program 9 times [2023-08-03 21:42:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:42:00,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330289907] [2023-08-03 21:42:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:42:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:42:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:42:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:42:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:42:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330289907] [2023-08-03 21:42:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330289907] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:42:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869281696] [2023-08-03 21:42:01,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-03 21:42:01,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:42:01,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:42:01,084 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:42:01,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-03 21:42:01,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-03 21:42:01,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:42:01,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 21:42:01,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:42:01,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:42:01,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:42:01,493 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:42:01,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:42:01,534 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:42:01,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:42:01,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:42:01,620 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:42:01,620 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:42:01,663 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:42:02,001 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:42:02,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:42:03,401 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 21:42:05,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:42:05,218 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 21:42:07,469 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:42:07,470 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 417 treesize of output 382 [2023-08-03 21:42:08,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:42:08,520 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 21:42:09,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:42:09,346 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 21:42:10,332 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:42:10,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:42:12,132 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:42:12,137 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:42:12,137 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 17 treesize of output 11 [2023-08-03 21:42:12,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:42:13,109 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:42:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:42:13,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:42:13,282 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2034 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2034) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 21:42:13,296 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2034 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2034) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2023-08-03 21:42:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:42:13,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869281696] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:42:13,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:42:13,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-08-03 21:42:13,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453011378] [2023-08-03 21:42:13,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:42:13,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-03 21:42:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:42:13,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-03 21:42:13,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=803, Unknown=11, NotChecked=118, Total=1056 [2023-08-03 21:42:13,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:42:13,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 925 transitions, 18778 flow. Second operand has 33 states, 33 states have (on average 139.45454545454547) internal successors, (4602), 33 states have internal predecessors, (4602), 0 states have call successors, (0), 0 states 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 21:42:13,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:42:13,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:42:13,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:42:27,903 WARN L233 SmtUtils]: Spent 8.77s on a formula simplification. DAG size of input: 192 DAG size of output: 110 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:44:06,859 WARN L233 SmtUtils]: Spent 1.49m on a formula simplification. DAG size of input: 150 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:44:09,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 21:44:45,936 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 129 DAG size of output: 101 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:44:57,287 INFO L124 PetriNetUnfolderBase]: 2579/7143 cut-off events. [2023-08-03 21:44:57,288 INFO L125 PetriNetUnfolderBase]: For 126816/126845 co-relation queries the response was YES. [2023-08-03 21:44:57,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53261 conditions, 7143 events. 2579/7143 cut-off events. For 126816/126845 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 66163 event pairs, 1114 based on Foata normal form. 32/6759 useless extension candidates. Maximal degree in co-relation 53090. Up to 4248 conditions per place. [2023-08-03 21:44:57,406 INFO L140 encePairwiseOnDemand]: 436/466 looper letters, 753 selfloop transitions, 320 changer transitions 209/1290 dead transitions. [2023-08-03 21:44:57,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 1290 transitions, 26660 flow [2023-08-03 21:44:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-08-03 21:44:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-08-03 21:44:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 10047 transitions. [2023-08-03 21:44:57,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3080012262415696 [2023-08-03 21:44:57,412 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 10047 transitions. [2023-08-03 21:44:57,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 10047 transitions. [2023-08-03 21:44:57,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:44:57,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 10047 transitions. [2023-08-03 21:44:57,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 143.52857142857144) internal successors, (10047), 70 states have internal predecessors, (10047), 0 states have call successors, (0), 0 states 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 21:44:57,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 466.0) internal successors, (33086), 71 states have internal predecessors, (33086), 0 states have call successors, (0), 0 states 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 21:44:57,440 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 466.0) internal successors, (33086), 71 states have internal predecessors, (33086), 0 states have call successors, (0), 0 states 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 21:44:57,440 INFO L175 Difference]: Start difference. First operand has 563 places, 925 transitions, 18778 flow. Second operand 70 states and 10047 transitions. [2023-08-03 21:44:57,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 1290 transitions, 26660 flow [2023-08-03 21:44:58,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 1290 transitions, 26080 flow, removed 184 selfloop flow, removed 20 redundant places. [2023-08-03 21:44:58,493 INFO L231 Difference]: Finished difference. Result has 641 places, 960 transitions, 20129 flow [2023-08-03 21:44:58,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=18312, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=20129, PETRI_PLACES=641, PETRI_TRANSITIONS=960} [2023-08-03 21:44:58,495 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 574 predicate places. [2023-08-03 21:44:58,495 INFO L495 AbstractCegarLoop]: Abstraction has has 641 places, 960 transitions, 20129 flow [2023-08-03 21:44:58,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 139.45454545454547) internal successors, (4602), 33 states have internal predecessors, (4602), 0 states have call successors, (0), 0 states 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 21:44:58,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:44:58,495 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:44:58,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-08-03 21:44:58,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:44:58,700 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:44:58,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:44:58,701 INFO L85 PathProgramCache]: Analyzing trace with hash 769441553, now seen corresponding path program 10 times [2023-08-03 21:44:58,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:44:58,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007742390] [2023-08-03 21:44:58,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:44:58,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:44:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:44:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:44:59,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:44:59,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007742390] [2023-08-03 21:44:59,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007742390] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:44:59,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820689611] [2023-08-03 21:44:59,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-03 21:44:59,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:44:59,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:44:59,670 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:44:59,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-03 21:44:59,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-03 21:44:59,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:44:59,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-03 21:44:59,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:45:00,029 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:45:00,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:00,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:00,069 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:45:00,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:45:00,179 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:45:00,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:00,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:00,223 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:45:00,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:45:00,643 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:45:00,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:45:01,287 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 21:45:03,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:03,262 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 21:45:04,982 INFO L322 Elim1Store]: treesize reduction 878, result has 15.3 percent of original size [2023-08-03 21:45:04,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 35 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 46 case distinctions, treesize of input 417 treesize of output 382 [2023-08-03 21:45:05,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:05,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 21:45:06,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:06,757 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 21:45:07,734 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:45:07,734 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:45:10,226 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:45:10,230 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:45:10,230 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 17 treesize of output 11 [2023-08-03 21:45:10,666 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:45:11,400 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:45:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:45:11,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:45:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:45:12,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820689611] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:45:12,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:45:12,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-08-03 21:45:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514161720] [2023-08-03 21:45:12,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:45:12,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-03 21:45:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:45:12,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-03 21:45:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=909, Unknown=14, NotChecked=0, Total=1056 [2023-08-03 21:45:12,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:45:12,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 641 places, 960 transitions, 20129 flow. Second operand has 33 states, 33 states have (on average 139.45454545454547) internal successors, (4602), 33 states have internal predecessors, (4602), 0 states have call successors, (0), 0 states 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 21:45:12,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:45:12,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:45:12,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:45:16,735 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse3 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse6 |c_~#A~0.offset| (+ (select .cse6 |c_~#A~0.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse7 |c_~#A~0.base| (let ((.cse8 (select .cse7 |c_~#A~0.base|))) (store .cse8 |c_~#A~0.offset| (+ (- 1) (select .cse8 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (.cse0 (forall ((v_ArrVal_2126 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2126) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (or .cse0 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse1 |c_~#A~0.base| (let ((.cse2 (select .cse1 |c_~#A~0.base|))) (store .cse2 |c_~#A~0.offset| (+ (- 1) (select .cse2 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or .cse0 .cse3) (or (forall ((v_ArrVal_2126 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_2126) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) .cse3) (or .cse0 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse6 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse4 |c_~#A~0.base| (let ((.cse5 (select .cse4 |c_~#A~0.base|))) (store .cse5 |c_~#A~0.offset| (+ (- 1) (select .cse5 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))))) is different from false [2023-08-03 21:45:18,267 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse19 (select .cse13 |c_~#A~0.offset|)) (.cse8 (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|))) (let ((.cse9 (not .cse8)) (.cse10 (= .cse19 0)) (.cse5 (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|))) (.cse6 (not (= |c_ULTIMATE.start_main_~d~0#1.offset| 0))) (.cse7 (= |c_~#A~0.offset| 0)) (.cse11 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse17 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse13 |c_~#A~0.offset| (+ .cse19 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse17 |c_~#A~0.base| (let ((.cse18 (select .cse17 |c_~#A~0.base|))) (store .cse18 |c_~#A~0.offset| (+ (- 1) (select .cse18 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (.cse2 (forall ((v_ArrVal_2126 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2126) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse0 (select |c_#memory_int| 3)) (.cse14 (select |c_#memory_int| 1)) (.cse1 (select |c_#memory_int| 4))) (and (= (select .cse0 4) 0) (= (select .cse1 12) 0) (= (select .cse0 16) 0) (= (select .cse0 8) 0) (= (select .cse1 4) 0) (= (select .cse0 0) 0) (= (select .cse1 0) 0) (or .cse2 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse3 |c_~#A~0.base| (let ((.cse4 (select .cse3 |c_~#A~0.base|))) (store .cse4 |c_~#A~0.offset| (+ (- 1) (select .cse4 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or (and .cse5 .cse6 .cse7 .cse8 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base|) 0) 0)) (and .cse9 .cse10)) (= (select .cse1 20) 0) (or .cse2 .cse11) (let ((.cse12 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)))) (or (and .cse9 .cse12 .cse10) (and .cse5 (or .cse6 (and (< |c_ULTIMATE.start_main_~m~0#1.offset| 13) (<= 12 |c_ULTIMATE.start_main_~m~0#1.offset|))) (= (select .cse13 0) 0) .cse7 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) .cse12))) .cse7 (or (forall ((v_ArrVal_2126 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_2126) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) .cse11) (= (select .cse14 1) 0) (= (select .cse1 16) 0) (= (select .cse1 8) 0) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (or .cse2 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse15 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse13 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse15 |c_~#A~0.base| (let ((.cse16 (select .cse15 |c_~#A~0.base|))) (store .cse16 |c_~#A~0.offset| (+ (- 1) (select .cse16 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (= (select .cse0 12) 0) (= |c_~#A~0.base| 4) (= (select .cse1 28) 0) (= 48 (select .cse14 0)) (= (select .cse1 24) 0))))) is different from false [2023-08-03 21:45:20,712 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2126 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2126) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)))) (.cse5 (select |c_#memory_int| |c_~#A~0.base|))) (and (or .cse0 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse1 |c_~#A~0.base| (let ((.cse2 (select .cse1 |c_~#A~0.base|))) (store .cse2 |c_~#A~0.offset| (+ (- 1) (select .cse2 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or .cse0 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse5 |c_~#A~0.offset| (+ (select .cse5 |c_~#A~0.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse3 |c_~#A~0.base| (let ((.cse4 (select .cse3 |c_~#A~0.base|))) (store .cse4 |c_~#A~0.offset| (+ (- 1) (select .cse4 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or .cse0 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse5 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse6 |c_~#A~0.base| (let ((.cse7 (select .cse6 |c_~#A~0.base|))) (store .cse7 |c_~#A~0.offset| (+ (- 1) (select .cse7 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))))) is different from false [2023-08-03 21:45:21,800 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (or (not (= (select (select |c_#pthreadsMutex| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0)) (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse1 |c_~#A~0.base| (let ((.cse2 (select .cse1 |c_~#A~0.base|))) (store .cse2 |c_~#A~0.offset| (+ (- 1) (select .cse2 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0)))) is different from false [2023-08-03 21:45:22,526 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse5 (select .cse4 |c_~#A~0.offset|))) (let ((.cse3 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse9 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ .cse5 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse9 |c_~#A~0.base| (let ((.cse10 (select .cse9 |c_~#A~0.base|))) (store .cse10 |c_~#A~0.offset| (+ (- 1) (select .cse10 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (.cse0 (forall ((v_ArrVal_2126 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2126) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (or .cse0 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse1 |c_~#A~0.base| (let ((.cse2 (select .cse1 |c_~#A~0.base|))) (store .cse2 |c_~#A~0.offset| (+ (- 1) (select .cse2 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or .cse0 .cse3) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ .cse5 (- 1)))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (or (forall ((v_ArrVal_2126 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store (select |c_#pthreadsMutex| |c_~#A~0.base|) (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_2126) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) .cse3) (let ((.cse6 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)))) (or (and (not (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) .cse6 (= .cse5 1)) (and (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|)) (= |c_~#A~0.offset| 0) (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) .cse6 (= (select .cse4 0) 1) (or (and (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| (store (select |c_#pthreadsMutex| |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset| 1)) |c_~#A~0.base|) 12) 1) (< |c_ULTIMATE.start_main_~m~0#1.offset| 13) (<= 12 |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~d~0#1.offset| 0)))))) (or .cse0 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse4 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse7 |c_~#A~0.base| (let ((.cse8 (select .cse7 |c_~#A~0.base|))) (store .cse8 |c_~#A~0.offset| (+ (- 1) (select .cse8 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))))))) is different from false [2023-08-03 21:45:25,654 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#A~0.base|))) (let ((.cse6 (= |c_ULTIMATE.start_main_~d~0#1.base| |c_~#A~0.base|)) (.cse15 (select .cse12 |c_~#A~0.offset|))) (let ((.cse9 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse16 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse12 |c_~#A~0.offset| (+ .cse15 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse16 |c_~#A~0.base| (let ((.cse17 (select .cse16 |c_~#A~0.base|))) (store .cse17 |c_~#A~0.offset| (+ (- 1) (select .cse17 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (.cse7 (not .cse6)) (.cse8 (= .cse15 0)) (.cse10 (select |c_#pthreadsMutex| |c_~#A~0.base|)) (.cse4 (not (= |c_ULTIMATE.start_main_~d~0#1.offset| 0))) (.cse3 (not (= |c_~#A~0.base| |c_~#__global_lock~0.base|))) (.cse5 (= |c_~#A~0.offset| 0)) (.cse0 (forall ((v_ArrVal_2126 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2126) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))))) (and (or .cse0 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse1 |c_~#A~0.base| (let ((.cse2 (select .cse1 |c_~#A~0.base|))) (store .cse2 |c_~#A~0.offset| (+ (- 1) (select .cse2 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))) (or (and .cse3 .cse4 .cse5 .cse6 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base|) 0) 0)) (and .cse7 .cse8)) (or .cse0 .cse9) (or (forall ((v_ArrVal_2126 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#A~0.base| (store .cse10 (+ |c_~#A~0.offset| 12) 1)) |c_~#__global_lock~0.base| v_ArrVal_2126) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 0))) .cse9) (let ((.cse11 (not (= |c_~#A~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)))) (or (and .cse7 .cse11 .cse8) (and (or (and (< |c_ULTIMATE.start_main_~m~0#1.offset| 13) (= (select .cse10 12) 1) (<= 12 |c_ULTIMATE.start_main_~m~0#1.offset|)) .cse4) .cse3 (= (select .cse12 0) 0) .cse5 (= |c_ULTIMATE.start_main_~m~0#1.base| |c_~#A~0.base|) .cse11))) (forall ((v_ArrVal_2131 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) (or .cse0 (forall ((v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (= (select (select (store (let ((.cse13 (store (store |c_#memory_int| |c_~#A~0.base| (store .cse12 |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2127))) (store .cse13 |c_~#A~0.base| (let ((.cse14 (select .cse13 |c_~#A~0.base|))) (store .cse14 |c_~#A~0.offset| (+ (- 1) (select .cse14 |c_~#A~0.offset|)))))) |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2131) |c_~#A~0.base|) |c_~#A~0.offset|) 0))))))) is different from false [2023-08-03 21:45:27,706 INFO L124 PetriNetUnfolderBase]: 2702/7623 cut-off events. [2023-08-03 21:45:27,706 INFO L125 PetriNetUnfolderBase]: For 166739/166771 co-relation queries the response was YES. [2023-08-03 21:45:27,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58599 conditions, 7623 events. 2702/7623 cut-off events. For 166739/166771 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 72329 event pairs, 1360 based on Foata normal form. 165/7351 useless extension candidates. Maximal degree in co-relation 58401. Up to 4606 conditions per place. [2023-08-03 21:45:27,831 INFO L140 encePairwiseOnDemand]: 430/466 looper letters, 762 selfloop transitions, 209 changer transitions 256/1235 dead transitions. [2023-08-03 21:45:27,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 1235 transitions, 27491 flow [2023-08-03 21:45:27,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-03 21:45:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-03 21:45:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 7723 transitions. [2023-08-03 21:45:27,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30690669209982513 [2023-08-03 21:45:27,836 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 7723 transitions. [2023-08-03 21:45:27,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 7723 transitions. [2023-08-03 21:45:27,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:45:27,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 7723 transitions. [2023-08-03 21:45:27,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 143.0185185185185) internal successors, (7723), 54 states have internal predecessors, (7723), 0 states have call successors, (0), 0 states 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 21:45:27,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 466.0) internal successors, (25630), 55 states have internal predecessors, (25630), 0 states have call successors, (0), 0 states 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 21:45:27,858 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 466.0) internal successors, (25630), 55 states have internal predecessors, (25630), 0 states have call successors, (0), 0 states 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 21:45:27,858 INFO L175 Difference]: Start difference. First operand has 641 places, 960 transitions, 20129 flow. Second operand 54 states and 7723 transitions. [2023-08-03 21:45:27,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 1235 transitions, 27491 flow [2023-08-03 21:45:29,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 1235 transitions, 26603 flow, removed 310 selfloop flow, removed 45 redundant places. [2023-08-03 21:45:29,192 INFO L231 Difference]: Finished difference. Result has 650 places, 922 transitions, 19308 flow [2023-08-03 21:45:29,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=19513, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=19308, PETRI_PLACES=650, PETRI_TRANSITIONS=922} [2023-08-03 21:45:29,193 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 583 predicate places. [2023-08-03 21:45:29,194 INFO L495 AbstractCegarLoop]: Abstraction has has 650 places, 922 transitions, 19308 flow [2023-08-03 21:45:29,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 139.45454545454547) internal successors, (4602), 33 states have internal predecessors, (4602), 0 states have call successors, (0), 0 states 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 21:45:29,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:45:29,194 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:45:29,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-03 21:45:29,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-03 21:45:29,400 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:45:29,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:45:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash -572841094, now seen corresponding path program 2 times [2023-08-03 21:45:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:45:29,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335975153] [2023-08-03 21:45:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:45:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:45:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:45:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 21:45:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:45:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335975153] [2023-08-03 21:45:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335975153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:45:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:45:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-03 21:45:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169712596] [2023-08-03 21:45:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:45:29,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-03 21:45:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:45:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-03 21:45:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:45:29,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 466 [2023-08-03 21:45:29,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 922 transitions, 19308 flow. Second operand has 6 states, 6 states have (on average 208.66666666666666) internal successors, (1252), 6 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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 21:45:29,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:45:29,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 466 [2023-08-03 21:45:29,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:45:31,981 INFO L124 PetriNetUnfolderBase]: 1910/5825 cut-off events. [2023-08-03 21:45:31,981 INFO L125 PetriNetUnfolderBase]: For 151124/151191 co-relation queries the response was YES. [2023-08-03 21:45:32,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48681 conditions, 5825 events. 1910/5825 cut-off events. For 151124/151191 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 54750 event pairs, 872 based on Foata normal form. 68/5835 useless extension candidates. Maximal degree in co-relation 48480. Up to 2175 conditions per place. [2023-08-03 21:45:32,071 INFO L140 encePairwiseOnDemand]: 459/466 looper letters, 794 selfloop transitions, 203 changer transitions 43/1128 dead transitions. [2023-08-03 21:45:32,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 1128 transitions, 24974 flow [2023-08-03 21:45:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:45:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:45:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1369 transitions. [2023-08-03 21:45:32,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896280400572246 [2023-08-03 21:45:32,073 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1369 transitions. [2023-08-03 21:45:32,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1369 transitions. [2023-08-03 21:45:32,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:45:32,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1369 transitions. [2023-08-03 21:45:32,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 228.16666666666666) internal successors, (1369), 6 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states 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 21:45:32,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 466.0) internal successors, (3262), 7 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states 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 21:45:32,075 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 466.0) internal successors, (3262), 7 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states 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 21:45:32,075 INFO L175 Difference]: Start difference. First operand has 650 places, 922 transitions, 19308 flow. Second operand 6 states and 1369 transitions. [2023-08-03 21:45:32,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 1128 transitions, 24974 flow [2023-08-03 21:45:33,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 1128 transitions, 23428 flow, removed 281 selfloop flow, removed 41 redundant places. [2023-08-03 21:45:33,014 INFO L231 Difference]: Finished difference. Result has 589 places, 870 transitions, 18116 flow [2023-08-03 21:45:33,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=16827, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18116, PETRI_PLACES=589, PETRI_TRANSITIONS=870} [2023-08-03 21:45:33,015 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 522 predicate places. [2023-08-03 21:45:33,015 INFO L495 AbstractCegarLoop]: Abstraction has has 589 places, 870 transitions, 18116 flow [2023-08-03 21:45:33,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.66666666666666) internal successors, (1252), 6 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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 21:45:33,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:45:33,015 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:45:33,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-03 21:45:33,016 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:45:33,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:45:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash 758390733, now seen corresponding path program 1 times [2023-08-03 21:45:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:45:33,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90902330] [2023-08-03 21:45:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:45:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:45:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:45:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:45:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:45:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90902330] [2023-08-03 21:45:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90902330] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:45:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891156135] [2023-08-03 21:45:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:45:33,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:45:33,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:45:33,318 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:45:33,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-03 21:45:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:45:33,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-03 21:45:33,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:45:33,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:33,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:33,654 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:45:33,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:45:33,680 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:45:33,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:33,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:33,754 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:45:33,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:45:33,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:45:34,136 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:45:34,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:45:35,046 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:45:35,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 400 treesize of output 327 [2023-08-03 21:45:36,255 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 21:45:37,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:45:37,295 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:45:37,296 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 17 treesize of output 11 [2023-08-03 21:45:38,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:45:39,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:45:41,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:45:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:45:42,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:45:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:45:42,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891156135] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:45:42,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:45:42,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-08-03 21:45:42,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906046177] [2023-08-03 21:45:42,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:45:42,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-03 21:45:42,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:45:42,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-03 21:45:42,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=328, Unknown=1, NotChecked=0, Total=420 [2023-08-03 21:45:43,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 466 [2023-08-03 21:45:43,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 870 transitions, 18116 flow. Second operand has 21 states, 21 states have (on average 141.14285714285714) internal successors, (2964), 21 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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 21:45:43,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:45:43,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 466 [2023-08-03 21:45:43,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:45:48,067 INFO L124 PetriNetUnfolderBase]: 2281/6643 cut-off events. [2023-08-03 21:45:48,067 INFO L125 PetriNetUnfolderBase]: For 150512/150570 co-relation queries the response was YES. [2023-08-03 21:45:48,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52759 conditions, 6643 events. 2281/6643 cut-off events. For 150512/150570 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 62196 event pairs, 1074 based on Foata normal form. 55/6681 useless extension candidates. Maximal degree in co-relation 52574. Up to 3915 conditions per place. [2023-08-03 21:45:48,164 INFO L140 encePairwiseOnDemand]: 446/466 looper letters, 699 selfloop transitions, 129 changer transitions 252/1088 dead transitions. [2023-08-03 21:45:48,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 1088 transitions, 23768 flow [2023-08-03 21:45:48,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-03 21:45:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-03 21:45:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3858 transitions. [2023-08-03 21:45:48,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3184219214262133 [2023-08-03 21:45:48,167 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3858 transitions. [2023-08-03 21:45:48,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3858 transitions. [2023-08-03 21:45:48,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:45:48,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3858 transitions. [2023-08-03 21:45:48,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 148.3846153846154) internal successors, (3858), 26 states have internal predecessors, (3858), 0 states have call successors, (0), 0 states 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 21:45:48,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 466.0) internal successors, (12582), 27 states have internal predecessors, (12582), 0 states have call successors, (0), 0 states 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 21:45:48,175 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 466.0) internal successors, (12582), 27 states have internal predecessors, (12582), 0 states have call successors, (0), 0 states 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 21:45:48,175 INFO L175 Difference]: Start difference. First operand has 589 places, 870 transitions, 18116 flow. Second operand 26 states and 3858 transitions. [2023-08-03 21:45:48,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 1088 transitions, 23768 flow [2023-08-03 21:45:49,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 1088 transitions, 23248 flow, removed 52 selfloop flow, removed 10 redundant places. [2023-08-03 21:45:49,087 INFO L231 Difference]: Finished difference. Result has 610 places, 797 transitions, 16582 flow [2023-08-03 21:45:49,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=17682, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=16582, PETRI_PLACES=610, PETRI_TRANSITIONS=797} [2023-08-03 21:45:49,087 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 543 predicate places. [2023-08-03 21:45:49,087 INFO L495 AbstractCegarLoop]: Abstraction has has 610 places, 797 transitions, 16582 flow [2023-08-03 21:45:49,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 141.14285714285714) internal successors, (2964), 21 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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 21:45:49,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:45:49,088 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:45:49,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-08-03 21:45:49,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-03 21:45:49,293 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:45:49,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:45:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash 178789731, now seen corresponding path program 11 times [2023-08-03 21:45:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:45:49,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568536505] [2023-08-03 21:45:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:45:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:45:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:45:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:45:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:45:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568536505] [2023-08-03 21:45:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568536505] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:45:49,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904988615] [2023-08-03 21:45:49,785 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-03 21:45:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:45:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:45:49,786 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:45:49,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-03 21:45:49,943 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-03 21:45:49,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:45:49,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-03 21:45:49,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:45:50,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:50,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:50,136 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:45:50,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:45:50,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:45:50,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:50,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:45:50,236 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:45:50,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:45:50,275 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:45:50,584 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:45:50,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:45:51,624 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:45:51,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:45:52,752 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 11 treesize of output 7 [2023-08-03 21:45:53,540 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 21:45:53,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 370 treesize of output 375 [2023-08-03 21:45:53,986 INFO L322 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2023-08-03 21:45:53,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 370 treesize of output 305 [2023-08-03 21:45:54,427 INFO L322 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-08-03 21:45:54,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 252 treesize of output 257 [2023-08-03 21:45:54,800 INFO L322 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-08-03 21:45:54,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 249 treesize of output 238 [2023-08-03 21:45:55,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 32 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 151 [2023-08-03 21:45:55,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 32 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 151 [2023-08-03 21:45:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:45:55,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:45:55,792 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2355 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~d~0#1.base| v_ArrVal_2355) |c_~#A~0.base|) |c_~#A~0.offset|))) (forall ((v_ArrVal_2356 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2356) |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 0)))) is different from false [2023-08-03 21:45:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:45:55,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904988615] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:45:55,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:45:55,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-08-03 21:45:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696075089] [2023-08-03 21:45:55,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:45:55,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-03 21:45:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:45:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-03 21:45:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=440, Unknown=7, NotChecked=44, Total=600 [2023-08-03 21:45:56,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:45:56,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 797 transitions, 16582 flow. Second operand has 25 states, 25 states have (on average 139.8) internal successors, (3495), 25 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states 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 21:45:56,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:45:56,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:45:56,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:46:07,709 WARN L233 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 79 DAG size of output: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:46:16,519 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 78 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 21:46:34,416 INFO L124 PetriNetUnfolderBase]: 1904/5572 cut-off events. [2023-08-03 21:46:34,416 INFO L125 PetriNetUnfolderBase]: For 127704/127753 co-relation queries the response was YES. [2023-08-03 21:46:34,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44318 conditions, 5572 events. 1904/5572 cut-off events. For 127704/127753 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 50723 event pairs, 562 based on Foata normal form. 39/5600 useless extension candidates. Maximal degree in co-relation 44126. Up to 2673 conditions per place. [2023-08-03 21:46:34,492 INFO L140 encePairwiseOnDemand]: 447/466 looper letters, 618 selfloop transitions, 235 changer transitions 128/989 dead transitions. [2023-08-03 21:46:34,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 989 transitions, 21313 flow [2023-08-03 21:46:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-03 21:46:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-03 21:46:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3989 transitions. [2023-08-03 21:46:34,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3170402161818471 [2023-08-03 21:46:34,495 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 3989 transitions. [2023-08-03 21:46:34,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 3989 transitions. [2023-08-03 21:46:34,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:46:34,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 3989 transitions. [2023-08-03 21:46:34,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 147.74074074074073) internal successors, (3989), 27 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states 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 21:46:34,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 466.0) internal successors, (13048), 28 states have internal predecessors, (13048), 0 states have call successors, (0), 0 states 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 21:46:34,503 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 466.0) internal successors, (13048), 28 states have internal predecessors, (13048), 0 states have call successors, (0), 0 states 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 21:46:34,503 INFO L175 Difference]: Start difference. First operand has 610 places, 797 transitions, 16582 flow. Second operand 27 states and 3989 transitions. [2023-08-03 21:46:34,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 989 transitions, 21313 flow [2023-08-03 21:46:35,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 989 transitions, 20924 flow, removed 81 selfloop flow, removed 30 redundant places. [2023-08-03 21:46:35,211 INFO L231 Difference]: Finished difference. Result has 587 places, 770 transitions, 16455 flow [2023-08-03 21:46:35,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=16266, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=16455, PETRI_PLACES=587, PETRI_TRANSITIONS=770} [2023-08-03 21:46:35,212 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 520 predicate places. [2023-08-03 21:46:35,212 INFO L495 AbstractCegarLoop]: Abstraction has has 587 places, 770 transitions, 16455 flow [2023-08-03 21:46:35,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 139.8) internal successors, (3495), 25 states have internal predecessors, (3495), 0 states have call successors, (0), 0 states 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 21:46:35,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:46:35,212 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:46:35,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-08-03 21:46:35,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-03 21:46:35,419 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 21:46:35,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:46:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash 639847927, now seen corresponding path program 2 times [2023-08-03 21:46:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:46:35,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281268535] [2023-08-03 21:46:35,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:46:35,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:46:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:46:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:46:35,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:46:35,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281268535] [2023-08-03 21:46:35,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281268535] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:46:35,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283686796] [2023-08-03 21:46:35,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:46:35,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:46:35,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:46:35,881 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:46:35,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-03 21:46:36,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:46:36,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:46:36,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-03 21:46:36,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:46:36,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:46:36,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:46:36,261 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:46:36,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:46:36,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:46:36,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:46:36,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:46:36,389 INFO L322 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-08-03 21:46:36,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 38 [2023-08-03 21:46:36,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-03 21:46:36,750 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:46:36,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:46:37,764 INFO L322 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2023-08-03 21:46:37,764 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 333 [2023-08-03 21:46:39,057 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 21:46:40,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-03 21:46:40,221 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 21:46:41,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-03 21:46:41,043 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-03 21:46:41,043 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 17 treesize of output 11 [2023-08-03 21:46:41,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:46:41,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 35 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 231 [2023-08-03 21:46:43,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 136 [2023-08-03 21:46:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:46:43,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:46:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:46:43,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283686796] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:46:43,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:46:43,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-08-03 21:46:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165874952] [2023-08-03 21:46:43,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:46:43,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-03 21:46:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:46:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-03 21:46:43,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=562, Unknown=9, NotChecked=0, Total=702 [2023-08-03 21:46:45,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 466 [2023-08-03 21:46:45,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 770 transitions, 16455 flow. Second operand has 27 states, 27 states have (on average 139.5185185185185) internal successors, (3767), 27 states have internal predecessors, (3767), 0 states have call successors, (0), 0 states 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 21:46:45,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:46:45,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 466 [2023-08-03 21:46:45,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-08-03 21:46:50,402 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-03 21:46:50,402 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 21:46:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-03 21:46:50,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 21:46:50,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-03 21:46:50,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-03 21:46:50,626 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (27states, 137/466 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 41424 conditions, 5096 events (1758/5095 cut-off events. For 127173/127181 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 46551 event pairs, 865 based on Foata normal form. 34/5291 useless extension candidates. Maximal degree in co-relation 41241. Up to 3152 conditions per place.). [2023-08-03 21:46:50,626 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 21:46:50,626 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 21:46:50,626 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 21:46:50,626 INFO L445 BasicCegarLoop]: Path program histogram: [11, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:46:50,626 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (2/2) [2023-08-03 21:46:50,628 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 21:46:50,628 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 21:46:50,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 09:46:50 BasicIcfg [2023-08-03 21:46:50,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 21:46:50,637 INFO L158 Benchmark]: Toolchain (without parser) took 844344.98ms. Allocated memory was 367.0MB in the beginning and 5.9GB in the end (delta: 5.5GB). Free memory was 316.9MB in the beginning and 4.0GB in the end (delta: -3.6GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2023-08-03 21:46:50,637 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 367.0MB. Free memory is still 320.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 21:46:50,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.14ms. Allocated memory is still 367.0MB. Free memory was 316.5MB in the beginning and 287.5MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-03 21:46:50,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.13ms. Allocated memory is still 367.0MB. Free memory was 287.5MB in the beginning and 284.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:46:50,637 INFO L158 Benchmark]: Boogie Preprocessor took 38.73ms. Allocated memory is still 367.0MB. Free memory was 284.6MB in the beginning and 282.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 21:46:50,637 INFO L158 Benchmark]: RCFGBuilder took 448.49ms. Allocated memory was 367.0MB in the beginning and 478.2MB in the end (delta: 111.1MB). Free memory was 282.6MB in the beginning and 443.1MB in the end (delta: -160.5MB). Peak memory consumption was 22.5MB. Max. memory is 16.0GB. [2023-08-03 21:46:50,646 INFO L158 Benchmark]: TraceAbstraction took 843422.95ms. Allocated memory was 478.2MB in the beginning and 5.9GB in the end (delta: 5.4GB). Free memory was 442.0MB in the beginning and 4.0GB in the end (delta: -3.5GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2023-08-03 21:46:50,647 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.08ms. Allocated memory is still 367.0MB. Free memory is still 320.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 399.14ms. Allocated memory is still 367.0MB. Free memory was 316.5MB in the beginning and 287.5MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.13ms. Allocated memory is still 367.0MB. Free memory was 287.5MB in the beginning and 284.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.73ms. Allocated memory is still 367.0MB. Free memory was 284.6MB in the beginning and 282.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 448.49ms. Allocated memory was 367.0MB in the beginning and 478.2MB in the end (delta: 111.1MB). Free memory was 282.6MB in the beginning and 443.1MB in the end (delta: -160.5MB). Peak memory consumption was 22.5MB. Max. memory is 16.0GB. * TraceAbstraction took 843422.95ms. Allocated memory was 478.2MB in the beginning and 5.9GB in the end (delta: 5.4GB). Free memory was 442.0MB in the beginning and 4.0GB in the end (delta: -3.5GB). Peak memory consumption was 5.2GB. 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 170 PlacesBefore, 44 PlacesAfterwards, 194 TransitionsBefore, 64 TransitionsAfterwards, 8664 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 166 TotalNumberOfCompositions, 18412 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7930, independent: 7563, independent conditional: 0, independent unconditional: 7563, dependent: 367, dependent conditional: 0, dependent unconditional: 367, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4262, independent: 4204, independent conditional: 0, independent unconditional: 4204, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7930, independent: 3359, independent conditional: 0, independent unconditional: 3359, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 4262, unknown conditional: 0, unknown unconditional: 4262] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 194, Positive conditional cache size: 0, Positive unconditional cache size: 194, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 222 PlacesBefore, 67 PlacesAfterwards, 258 TransitionsBefore, 98 TransitionsAfterwards, 25080 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 115 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 20 ConcurrentYvCompositions, 5 ChoiceCompositions, 206 TotalNumberOfCompositions, 57220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22399, independent: 21824, independent conditional: 0, independent unconditional: 21824, dependent: 575, dependent conditional: 0, dependent unconditional: 575, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11916, independent: 11825, independent conditional: 0, independent unconditional: 11825, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 22399, independent: 9999, independent conditional: 0, independent unconditional: 9999, dependent: 484, dependent conditional: 0, dependent unconditional: 484, unknown: 11916, unknown conditional: 0, unknown unconditional: 11916] , Statistics on independence cache: Total cache size (in pairs): 521, Positive cache size: 478, Positive conditional cache size: 0, Positive unconditional cache size: 478, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 222 PlacesBefore, 67 PlacesAfterwards, 258 TransitionsBefore, 98 TransitionsAfterwards, 25080 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 116 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 20 ConcurrentYvCompositions, 5 ChoiceCompositions, 206 TotalNumberOfCompositions, 57214 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21967, independent: 21392, independent conditional: 0, independent unconditional: 21392, dependent: 575, dependent conditional: 0, dependent unconditional: 575, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11945, independent: 11847, independent conditional: 0, independent unconditional: 11847, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 21967, independent: 9545, independent conditional: 0, independent unconditional: 9545, dependent: 477, dependent conditional: 0, dependent unconditional: 477, unknown: 11945, unknown conditional: 0, unknown unconditional: 11945] , Statistics on independence cache: Total cache size (in pairs): 540, Positive cache size: 497, Positive conditional cache size: 0, Positive unconditional cache size: 497, 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: 999]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (27states, 137/466 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 41424 conditions, 5096 events (1758/5095 cut-off events. For 127173/127181 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 46551 event pairs, 865 based on Foata normal form. 34/5291 useless extension candidates. Maximal degree in co-relation 41241. Up to 3152 conditions per place.). - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (27states, 137/466 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 41424 conditions, 5096 events (1758/5095 cut-off events. For 127173/127181 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 46551 event pairs, 865 based on Foata normal form. 34/5291 useless extension candidates. Maximal degree in co-relation 41241. Up to 3152 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 219 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: 6.6s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 265 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: 7.5s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 92 SizeOfPredicates, 22 NumberOfNonLiveVariables, 62 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 14/24 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 1 thread instances CFG has 4 procedures, 265 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: 829.2s, OverallIterations: 37, TraceHistogramMax: 3, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 602.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 2398 mSolverCounterUnknown, 20879 SdHoareTripleChecker+Valid, 159.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19676 mSDsluCounter, 3875 SdHoareTripleChecker+Invalid, 153.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10332 IncrementalHoareTripleChecker+Unchecked, 3691 mSDsCounter, 5211 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63516 IncrementalHoareTripleChecker+Invalid, 81457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5211 mSolverCounterUnsat, 184 mSDtfsCounter, 63516 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 2398 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2493 GetRequests, 1172 SyntacticMatches, 102 SemanticMatches, 1219 ConstructedPredicates, 38 IntricatePredicates, 2 DeprecatedPredicates, 23610 ImplicationChecksByTransitivity, 383.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20129occurred in iteration=32, InterpolantAutomatonStates: 951, 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.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 211.2s InterpolantComputationTime, 1688 NumberOfCodeBlocks, 1688 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 2333 ConstructedInterpolants, 329 QuantifiedInterpolants, 224328 SizeOfPredicates, 593 NumberOfNonLiveVariables, 3906 ConjunctsInSsa, 756 ConjunctsInUnsatCore, 91 InterpolantComputations, 11 PerfectInterpolantSequences, 105/487 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